/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 18:45:16,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 18:45:16,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 18:45:16,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 18:45:16,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 18:45:16,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 18:45:16,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 18:45:16,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 18:45:16,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 18:45:16,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 18:45:16,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 18:45:16,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 18:45:16,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 18:45:16,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 18:45:16,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 18:45:16,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 18:45:16,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 18:45:16,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 18:45:16,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 18:45:16,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 18:45:16,658 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 18:45:16,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 18:45:16,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 18:45:16,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 18:45:16,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 18:45:16,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 18:45:16,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 18:45:16,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 18:45:16,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 18:45:16,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 18:45:16,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 18:45:16,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 18:45:16,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 18:45:16,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 18:45:16,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 18:45:16,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 18:45:16,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 18:45:16,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 18:45:16,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 18:45:16,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 18:45:16,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 18:45:16,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 18:45:16,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 18:45:16,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 18:45:16,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 18:45:16,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 18:45:16,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 18:45:16,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 18:45:16,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 18:45:16,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 18:45:16,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 18:45:16,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 18:45:16,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 18:45:16,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 18:45:16,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 18:45:16,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 18:45:16,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 18:45:16,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 18:45:16,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 18:45:16,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 18:45:16,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 18:45:16,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:45:16,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 18:45:16,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 18:45:16,697 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 18:45:16,697 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 18:45:16,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 18:45:16,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 18:45:16,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 18:45:16,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 18:45:16,935 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 18:45:16,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound10.c [2022-04-27 18:45:16,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7b155d4/b483e9a5511b4364bb10ca8cdd5f6a4b/FLAG05bceb93a [2022-04-27 18:45:17,378 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 18:45:17,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound10.c [2022-04-27 18:45:17,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7b155d4/b483e9a5511b4364bb10ca8cdd5f6a4b/FLAG05bceb93a [2022-04-27 18:45:17,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7b155d4/b483e9a5511b4364bb10ca8cdd5f6a4b [2022-04-27 18:45:17,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 18:45:17,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 18:45:17,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 18:45:17,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 18:45:17,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 18:45:17,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:45:17" (1/1) ... [2022-04-27 18:45:17,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e188988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:17, skipping insertion in model container [2022-04-27 18:45:17,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:45:17" (1/1) ... [2022-04-27 18:45:17,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 18:45:17,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 18:45:18,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound10.c[525,538] [2022-04-27 18:45:18,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:45:18,040 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 18:45:18,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound10.c[525,538] [2022-04-27 18:45:18,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:45:18,081 INFO L208 MainTranslator]: Completed translation [2022-04-27 18:45:18,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18 WrapperNode [2022-04-27 18:45:18,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 18:45:18,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 18:45:18,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 18:45:18,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 18:45:18,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 18:45:18,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 18:45:18,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 18:45:18,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 18:45:18,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:45:18,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:45:18,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 18:45:18,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 18:45:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 18:45:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 18:45:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 18:45:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 18:45:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 18:45:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 18:45:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 18:45:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 18:45:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 18:45:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 18:45:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 18:45:18,227 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 18:45:18,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 18:45:18,400 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 18:45:18,406 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 18:45:18,406 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 18:45:18,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:45:18 BoogieIcfgContainer [2022-04-27 18:45:18,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 18:45:18,409 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 18:45:18,409 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 18:45:18,409 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 18:45:18,412 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:45:18" (1/1) ... [2022-04-27 18:45:18,414 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 18:45:18,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:45:18 BasicIcfg [2022-04-27 18:45:18,461 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 18:45:18,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 18:45:18,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 18:45:18,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 18:45:18,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 06:45:17" (1/4) ... [2022-04-27 18:45:18,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3861c56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:45:18, skipping insertion in model container [2022-04-27 18:45:18,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:45:18" (2/4) ... [2022-04-27 18:45:18,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3861c56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:45:18, skipping insertion in model container [2022-04-27 18:45:18,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:45:18" (3/4) ... [2022-04-27 18:45:18,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3861c56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:45:18, skipping insertion in model container [2022-04-27 18:45:18,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:45:18" (4/4) ... [2022-04-27 18:45:18,467 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_valuebound10.cJordan [2022-04-27 18:45:18,489 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 18:45:18,490 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 18:45:18,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 18:45:18,570 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@566989d3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28e1591d [2022-04-27 18:45:18,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 18:45:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 18:45:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 18:45:18,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:45:18,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:45:18,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:45:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:45:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1141493127, now seen corresponding path program 1 times [2022-04-27 18:45:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:45:18,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804477749] [2022-04-27 18:45:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:45:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:45:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:45:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 18:45:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:45:18,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 18:45:18,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 18:45:18,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 18:45:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 18:45:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:45:18,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 18:45:18,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [74] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [94] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_8 10) (<= 0 v_main_~z~0_8)) 1 0)) InVars {main_~z~0=v_main_~z~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 18:45:18,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 18:45:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:45:18,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 18:45:18,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [74] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} [95] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 10)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 18:45:18,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 18:45:18,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 18:45:18,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 18:45:18,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 18:45:18,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 18:45:18,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [68] mainENTRY-->L27: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {32#true} is VALID [2022-04-27 18:45:18,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [70] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_8 10) (<= 0 v_main_~z~0_8)) 1 0)) InVars {main_~z~0=v_main_~z~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-27 18:45:18,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 18:45:18,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [74] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [94] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_8 10) (<= 0 v_main_~z~0_8)) 1 0)) InVars {main_~z~0=v_main_~z~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 18:45:18,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} [71] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {33#false} is VALID [2022-04-27 18:45:18,855 INFO L272 TraceCheckUtils]: 12: Hoare triple {33#false} [73] L29-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 10)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-27 18:45:18,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 18:45:18,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} [74] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,857 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33#false} {33#false} [95] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 10)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 18:45:18,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [76] L29-1-->L35-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~c~0_2 1) (= v_main_~y~0_3 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {33#false} is VALID [2022-04-27 18:45:18,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} [80] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,857 INFO L272 TraceCheckUtils]: 19: Hoare triple {33#false} [82] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_7) (* (- 1) (* v_main_~y~0_7 v_main_~z~0_9)) (* v_main_~x~0_7 v_main_~z~0_9) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {33#false} is VALID [2022-04-27 18:45:18,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [84] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-27 18:45:18,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {33#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 18:45:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:45:18,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:45:18,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804477749] [2022-04-27 18:45:18,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804477749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:45:18,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:45:18,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 18:45:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122752200] [2022-04-27 18:45:18,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:45:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 18:45:18,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:45:18,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:45:18,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:45:18,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 18:45:18,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:45:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 18:45:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:45:18,938 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:45:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:45:19,052 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-27 18:45:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 18:45:19,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 18:45:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:45:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:45:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 18:45:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:45:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 18:45:19,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 18:45:19,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:45:19,139 INFO L225 Difference]: With dead ends: 29 [2022-04-27 18:45:19,140 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 18:45:19,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:45:19,144 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:45:19,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 18:45:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 18:45:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 18:45:19,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:45:19,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:45:19,169 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:45:19,169 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:45:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:45:19,173 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 18:45:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 18:45:19,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:45:19,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:45:19,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 18:45:19,175 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 18:45:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:45:19,178 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 18:45:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 18:45:19,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:45:19,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:45:19,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:45:19,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:45:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:45:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 18:45:19,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2022-04-27 18:45:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:45:19,182 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 18:45:19,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:45:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 18:45:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 18:45:19,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:45:19,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:45:19,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 18:45:19,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:45:19,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:45:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1441395781, now seen corresponding path program 1 times [2022-04-27 18:45:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:45:19,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115805221] [2022-04-27 18:45:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:45:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:45:19,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:45:19,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104582011] [2022-04-27 18:45:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:45:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:45:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:45:19,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:45:19,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 18:45:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:45:19,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 18:45:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:45:19,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:45:19,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {149#true} is VALID [2022-04-27 18:45:19,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} [68] mainENTRY-->L27: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {149#true} is VALID [2022-04-27 18:45:19,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {149#true} [70] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_8 10) (<= 0 v_main_~z~0_8)) 1 0)) InVars {main_~z~0=v_main_~z~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 18:45:19,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {149#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {175#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 18:45:19,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [75] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {179#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:45:19,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#(not (= |assume_abort_if_not_#in~cond| 0))} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:45:19,590 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {179#(not (= |assume_abort_if_not_#in~cond| 0))} {149#true} [94] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_8 10) (<= 0 v_main_~z~0_8)) 1 0)) InVars {main_~z~0=v_main_~z~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {186#(and (<= main_~z~0 10) (<= 0 main_~z~0))} is VALID [2022-04-27 18:45:19,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#(and (<= main_~z~0 10) (<= 0 main_~z~0))} [71] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {186#(and (<= main_~z~0 10) (<= 0 main_~z~0))} is VALID [2022-04-27 18:45:19,591 INFO L272 TraceCheckUtils]: 12: Hoare triple {186#(and (<= main_~z~0 10) (<= 0 main_~z~0))} [73] L29-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 10)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 18:45:19,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {149#true} is VALID [2022-04-27 18:45:19,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {149#true} [75] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#true} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,592 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {149#true} {186#(and (<= main_~z~0 10) (<= 0 main_~z~0))} [95] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 10)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {186#(and (<= main_~z~0 10) (<= 0 main_~z~0))} is VALID [2022-04-27 18:45:19,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {186#(and (<= main_~z~0 10) (<= 0 main_~z~0))} [76] L29-1-->L35-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~c~0_2 1) (= v_main_~y~0_3 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {208#(and (<= main_~z~0 10) (= main_~y~0 1) (= main_~x~0 1) (<= 0 main_~z~0))} is VALID [2022-04-27 18:45:19,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {208#(and (<= main_~z~0 10) (= main_~y~0 1) (= main_~x~0 1) (<= 0 main_~z~0))} [80] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(and (<= main_~z~0 10) (= main_~y~0 1) (= main_~x~0 1) (<= 0 main_~z~0))} is VALID [2022-04-27 18:45:19,594 INFO L272 TraceCheckUtils]: 19: Hoare triple {208#(and (<= main_~z~0 10) (= main_~y~0 1) (= main_~x~0 1) (<= 0 main_~z~0))} [82] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_7) (* (- 1) (* v_main_~y~0_7 v_main_~z~0_9)) (* v_main_~x~0_7 v_main_~z~0_9) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {215#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:45:19,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {215#(<= 1 |__VERIFIER_assert_#in~cond|)} [84] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {219#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:45:19,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {219#(<= 1 __VERIFIER_assert_~cond)} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {150#false} is VALID [2022-04-27 18:45:19,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {150#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#false} is VALID [2022-04-27 18:45:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 18:45:19,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:45:19,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {150#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#false} is VALID [2022-04-27 18:45:19,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {219#(<= 1 __VERIFIER_assert_~cond)} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {150#false} is VALID [2022-04-27 18:45:19,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {215#(<= 1 |__VERIFIER_assert_#in~cond|)} [84] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {219#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:45:19,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {235#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} [82] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_7) (* (- 1) (* v_main_~y~0_7 v_main_~z~0_9)) (* v_main_~x~0_7 v_main_~z~0_9) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {215#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:45:19,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {235#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} [80] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 18:45:19,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {149#true} [76] L29-1-->L35-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~c~0_2 1) (= v_main_~y~0_3 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {235#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 18:45:19,855 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {149#true} {149#true} [95] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 10)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 18:45:19,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#true} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {149#true} [75] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {149#true} is VALID [2022-04-27 18:45:19,855 INFO L272 TraceCheckUtils]: 12: Hoare triple {149#true} [73] L29-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 10)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 18:45:19,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {149#true} [71] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {149#true} is VALID [2022-04-27 18:45:19,856 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {149#true} {149#true} [94] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_8 10) (<= 0 v_main_~z~0_8)) 1 0)) InVars {main_~z~0=v_main_~z~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 18:45:19,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {149#true} [77] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {149#true} [75] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {149#true} [72] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {149#true} is VALID [2022-04-27 18:45:19,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {149#true} [70] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_8 10) (<= 0 v_main_~z~0_8)) 1 0)) InVars {main_~z~0=v_main_~z~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 18:45:19,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} [68] mainENTRY-->L27: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {149#true} is VALID [2022-04-27 18:45:19,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {149#true} is VALID [2022-04-27 18:45:19,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 18:45:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:45:19,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:45:19,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115805221] [2022-04-27 18:45:19,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:45:19,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104582011] [2022-04-27 18:45:19,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104582011] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 18:45:19,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 18:45:19,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 18:45:19,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141249027] [2022-04-27 18:45:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:45:19,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 18:45:19,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:45:19,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:45:19,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:45:19,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 18:45:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:45:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 18:45:19,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 18:45:19,880 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:45:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:45:20,078 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 18:45:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 18:45:20,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 18:45:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:45:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:45:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 18:45:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:45:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 18:45:20,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 18:45:20,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:45:20,121 INFO L225 Difference]: With dead ends: 22 [2022-04-27 18:45:20,121 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 18:45:20,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 18:45:20,123 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 18:45:20,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 18:45:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 18:45:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 18:45:20,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:45:20,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:45:20,125 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:45:20,125 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:45:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:45:20,125 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 18:45:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:45:20,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:45:20,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:45:20,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 18:45:20,126 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 18:45:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:45:20,126 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 18:45:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:45:20,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:45:20,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:45:20,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:45:20,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:45:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:45:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 18:45:20,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 18:45:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:45:20,127 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 18:45:20,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:45:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:45:20,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:45:20,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 18:45:20,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 18:45:20,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:45:20,355 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 18:45:20,356 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 18:45:20,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:45:20 BasicIcfg [2022-04-27 18:45:20,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 18:45:20,360 INFO L158 Benchmark]: Toolchain (without parser) took 2542.55ms. Allocated memory is still 174.1MB. Free memory was 127.7MB in the beginning and 102.7MB in the end (delta: 25.0MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. [2022-04-27 18:45:20,361 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 18:45:20,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.73ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 152.8MB in the end (delta: -25.3MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-04-27 18:45:20,361 INFO L158 Benchmark]: Boogie Preprocessor took 24.75ms. Allocated memory is still 174.1MB. Free memory was 152.8MB in the beginning and 151.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 18:45:20,362 INFO L158 Benchmark]: RCFGBuilder took 300.44ms. Allocated memory is still 174.1MB. Free memory was 151.2MB in the beginning and 140.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 18:45:20,362 INFO L158 Benchmark]: IcfgTransformer took 52.30ms. Allocated memory is still 174.1MB. Free memory was 140.6MB in the beginning and 138.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 18:45:20,363 INFO L158 Benchmark]: TraceAbstraction took 1897.27ms. Allocated memory is still 174.1MB. Free memory was 138.4MB in the beginning and 102.7MB in the end (delta: 35.7MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. [2022-04-27 18:45:20,364 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.73ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 152.8MB in the end (delta: -25.3MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.75ms. Allocated memory is still 174.1MB. Free memory was 152.8MB in the beginning and 151.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 300.44ms. Allocated memory is still 174.1MB. Free memory was 151.2MB in the beginning and 140.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 52.30ms. Allocated memory is still 174.1MB. Free memory was 140.6MB in the beginning and 138.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1897.27ms. Allocated memory is still 174.1MB. Free memory was 138.4MB in the beginning and 102.7MB in the end (delta: 35.7MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 47 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 150 SizeOfPredicates, 2 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 9/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 18:45:20,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...