/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:38:45,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:38:45,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:38:45,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:38:45,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:38:45,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:38:45,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:38:45,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:38:45,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:38:45,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:38:45,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:38:45,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:38:45,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:38:45,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:38:45,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:38:45,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:38:45,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:38:45,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:38:45,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:38:45,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:38:45,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:38:45,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:38:45,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:38:45,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:38:45,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:38:45,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:38:45,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:38:45,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:38:45,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:38:45,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:38:45,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:38:45,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:38:45,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:38:45,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:38:45,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:38:45,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:38:45,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:38:45,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:38:45,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:38:45,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:38:45,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:38:45,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:38:45,980 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:38:45,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:38:45,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:38:45,982 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:38:45,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:38:45,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:38:45,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:38:45,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:38:45,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:38:45,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:38:45,983 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:38:45,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:38:45,984 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:38:45,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:38:45,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:38:45,984 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:38:45,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:38:45,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:38:45,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:38:45,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:38:45,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:38:45,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:38:45,986 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:38:46,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:38:46,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:38:46,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:38:46,327 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:38:46,327 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:38:46,328 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-10 18:38:46,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d4eb5a0/1c2749ef0a114c6eb01fc8275ed4862d/FLAG5ff59bfc6 [2020-07-10 18:38:46,851 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:38:46,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-10 18:38:46,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d4eb5a0/1c2749ef0a114c6eb01fc8275ed4862d/FLAG5ff59bfc6 [2020-07-10 18:38:47,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d4eb5a0/1c2749ef0a114c6eb01fc8275ed4862d [2020-07-10 18:38:47,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:38:47,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:38:47,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:38:47,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:38:47,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:38:47,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30564470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47, skipping insertion in model container [2020-07-10 18:38:47,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:38:47,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:38:47,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:38:47,478 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:38:47,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:38:47,508 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:38:47,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47 WrapperNode [2020-07-10 18:38:47,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:38:47,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:38:47,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:38:47,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:38:47,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... [2020-07-10 18:38:47,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:38:47,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:38:47,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:38:47,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:38:47,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:38:47,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:38:47,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:38:47,695 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-10 18:38:47,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:38:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:38:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:38:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-10 18:38:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:38:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:38:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:38:47,945 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:38:47,945 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:38:47,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:38:47 BoogieIcfgContainer [2020-07-10 18:38:47,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:38:47,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:38:47,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:38:47,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:38:47,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:38:47" (1/3) ... [2020-07-10 18:38:47,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546c0472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:38:47, skipping insertion in model container [2020-07-10 18:38:47,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:47" (2/3) ... [2020-07-10 18:38:47,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546c0472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:38:47, skipping insertion in model container [2020-07-10 18:38:47,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:38:47" (3/3) ... [2020-07-10 18:38:47,959 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-10 18:38:47,970 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:38:47,978 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:38:47,995 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:38:48,027 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:38:48,028 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:38:48,028 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:38:48,028 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:38:48,028 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:38:48,029 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:38:48,029 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:38:48,029 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:38:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-10 18:38:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 18:38:48,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:38:48,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:38:48,064 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:38:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:38:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-10 18:38:48,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:38:48,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281863758] [2020-07-10 18:38:48,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:38:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:48,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-10 18:38:48,345 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-10 18:38:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:48,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-10 18:38:48,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-10 18:38:48,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-10 18:38:48,425 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-10 18:38:48,428 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 18:38:48,429 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-10 18:38:48,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-10 18:38:48,431 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-10 18:38:48,431 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-10 18:38:48,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-10 18:38:48,432 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-10 18:38:48,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-10 18:38:48,433 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-10 18:38:48,434 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-10 18:38:48,434 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-10 18:38:48,436 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-10 18:38:48,437 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-10 18:38:48,440 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 18:38:48,441 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 18:38:48,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-10 18:38:48,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-10 18:38:48,446 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 5 == ~result~0; {34#false} is VALID [2020-07-10 18:38:48,446 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-10 18:38:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:38:48,450 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:38:48,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281863758] [2020-07-10 18:38:48,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:38:48,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:38:48,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712038786] [2020-07-10 18:38:48,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:38:48,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:38:48,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:38:48,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:48,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:38:48,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:38:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:38:48,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:38:48,523 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-10 18:38:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:48,783 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-10 18:38:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:38:48,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:38:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:38:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:38:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-10 18:38:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:38:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-10 18:38:48,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-10 18:38:48,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:48,894 INFO L225 Difference]: With dead ends: 44 [2020-07-10 18:38:48,894 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 18:38:48,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:38:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 18:38:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 18:38:48,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:38:48,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 18:38:48,960 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 18:38:48,961 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 18:38:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:48,967 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-10 18:38:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 18:38:48,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:48,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:48,968 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 18:38:48,969 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 18:38:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:48,973 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-10 18:38:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 18:38:48,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:48,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:48,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:38:48,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:38:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 18:38:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-10 18:38:48,981 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-10 18:38:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:38:48,981 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-10 18:38:48,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:38:48,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-10 18:38:49,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 18:38:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 18:38:49,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:38:49,051 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:38:49,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:38:49,052 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:38:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:38:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-10 18:38:49,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:38:49,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209487242] [2020-07-10 18:38:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 Garbage collection #2: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #3: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 [2020-07-10 18:38:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:49,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-10 18:38:49,335 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-10 18:38:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:49,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-10 18:38:49,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-10 18:38:49,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-10 18:38:49,408 INFO L280 TraceCheckUtils]: 3: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse22 (* 2 |v_oct_id_#res_out_1|)) (.cse23 (* 2 |v_oct_id_#res_in_1|)) (.cse21 (* 2 v_oct_id_~ret~0_out_1))) (let ((.cse6 (<= 0 (+ .cse21 4294967294))) (.cse5 (<= .cse23 4294967294)) (.cse7 (<= .cse21 4294967296)) (.cse8 (<= 0 (+ .cse21 4294967294))) (.cse10 (<= .cse23 4294967294)) (.cse9 (<= .cse21 4294967296)) (.cse0 (<= .cse22 6)) (.cse3 (<= 6 .cse23)) (.cse2 (<= 8 .cse21)) (.cse1 (<= 6 .cse22)) (.cse4 (<= .cse21 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse10 .cse1 .cse2 .cse3 .cse4) (let ((.cse11 (+ |v_oct_id_#res_in_1| 1)) (.cse12 (not .cse4)) (.cse13 (not .cse1)) (.cse14 (not .cse2)) (.cse15 (not .cse3)) (.cse16 (not .cse0))) (and (<= v_oct_id_~ret~0_out_1 .cse11) (or (not .cse6) .cse12 .cse13 .cse14 .cse15 (not .cse5) .cse16 (not .cse7)) (<= .cse11 v_oct_id_~ret~0_out_1) .cse0 (or .cse12 (not .cse8) .cse13 .cse14 (not .cse10) .cse15 (not .cse9) .cse16) .cse1 (let ((.cse17 (<= 0 (+ .cse21 4294967294))) (.cse19 (<= 0 (+ .cse21 4294967294))) (.cse20 (<= .cse21 4294967296))) (or (and .cse17 .cse2 (let ((.cse18 (<= .cse21 4294967296))) (or .cse18 (and .cse19 .cse20 (not .cse18))))) (and (not .cse17) .cse2 .cse19 .cse20)))))))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {262#(<= |id_#res| 3)} is VALID [2020-07-10 18:38:49,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {262#(<= |id_#res| 3)} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(<= |id_#res| 3)} is VALID [2020-07-10 18:38:49,412 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {262#(<= |id_#res| 3)} {249#true} #43#return; {259#(<= |main_#t~ret2| 3)} is VALID [2020-07-10 18:38:49,412 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-10 18:38:49,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-10 18:38:49,413 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-10 18:38:49,413 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-10 18:38:49,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-10 18:38:49,414 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-10 18:38:49,415 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-10 18:38:49,415 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-10 18:38:49,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-10 18:38:49,416 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-10 18:38:49,416 INFO L263 TraceCheckUtils]: 10: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-10 18:38:49,417 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-10 18:38:49,417 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-10 18:38:49,418 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-10 18:38:49,421 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse22 (* 2 |v_oct_id_#res_out_1|)) (.cse23 (* 2 |v_oct_id_#res_in_1|)) (.cse21 (* 2 v_oct_id_~ret~0_out_1))) (let ((.cse6 (<= 0 (+ .cse21 4294967294))) (.cse5 (<= .cse23 4294967294)) (.cse7 (<= .cse21 4294967296)) (.cse8 (<= 0 (+ .cse21 4294967294))) (.cse10 (<= .cse23 4294967294)) (.cse9 (<= .cse21 4294967296)) (.cse0 (<= .cse22 6)) (.cse3 (<= 6 .cse23)) (.cse2 (<= 8 .cse21)) (.cse1 (<= 6 .cse22)) (.cse4 (<= .cse21 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse10 .cse1 .cse2 .cse3 .cse4) (let ((.cse11 (+ |v_oct_id_#res_in_1| 1)) (.cse12 (not .cse4)) (.cse13 (not .cse1)) (.cse14 (not .cse2)) (.cse15 (not .cse3)) (.cse16 (not .cse0))) (and (<= v_oct_id_~ret~0_out_1 .cse11) (or (not .cse6) .cse12 .cse13 .cse14 .cse15 (not .cse5) .cse16 (not .cse7)) (<= .cse11 v_oct_id_~ret~0_out_1) .cse0 (or .cse12 (not .cse8) .cse13 .cse14 (not .cse10) .cse15 (not .cse9) .cse16) .cse1 (let ((.cse17 (<= 0 (+ .cse21 4294967294))) (.cse19 (<= 0 (+ .cse21 4294967294))) (.cse20 (<= .cse21 4294967296))) (or (and .cse17 .cse2 (let ((.cse18 (<= .cse21 4294967296))) (or .cse18 (and .cse19 .cse20 (not .cse18))))) (and (not .cse17) .cse2 .cse19 .cse20)))))))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {262#(<= |id_#res| 3)} is VALID [2020-07-10 18:38:49,423 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(<= |id_#res| 3)} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(<= |id_#res| 3)} is VALID [2020-07-10 18:38:49,426 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {262#(<= |id_#res| 3)} {249#true} #43#return; {259#(<= |main_#t~ret2| 3)} is VALID [2020-07-10 18:38:49,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {259#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {259#(<= |main_#t~ret2| 3)} is VALID [2020-07-10 18:38:49,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {259#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {260#(<= main_~result~0 3)} is VALID [2020-07-10 18:38:49,432 INFO L280 TraceCheckUtils]: 19: Hoare triple {260#(<= main_~result~0 3)} havoc #t~ret2; {260#(<= main_~result~0 3)} is VALID [2020-07-10 18:38:49,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {260#(<= main_~result~0 3)} assume 5 == ~result~0; {250#false} is VALID [2020-07-10 18:38:49,433 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-10 18:38:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 18:38:49,510 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:38:49,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209487242] [2020-07-10 18:38:49,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:38:49,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 18:38:49,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386800910] [2020-07-10 18:38:49,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-10 18:38:49,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:38:49,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 18:38:49,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:49,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 18:38:49,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:38:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 18:38:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 18:38:49,553 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 9 states. [2020-07-10 18:38:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:49,873 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-10 18:38:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 18:38:49,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-10 18:38:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:38:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 18:38:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-10 18:38:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 18:38:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-10 18:38:49,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2020-07-10 18:38:49,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:49,974 INFO L225 Difference]: With dead ends: 55 [2020-07-10 18:38:49,974 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 18:38:49,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-10 18:38:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 18:38:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-10 18:38:50,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:38:50,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-10 18:38:50,012 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-10 18:38:50,012 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-10 18:38:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:50,016 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 18:38:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 18:38:50,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:50,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:50,017 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-10 18:38:50,018 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-10 18:38:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:50,021 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 18:38:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 18:38:50,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:50,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:50,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:38:50,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:38:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 18:38:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-10 18:38:50,026 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-10 18:38:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:38:50,027 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-10 18:38:50,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 18:38:50,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-10 18:38:50,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-10 18:38:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 18:38:50,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:38:50,079 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:38:50,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:38:50,079 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:38:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:38:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 1 times [2020-07-10 18:38:50,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:38:50,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1610260452] [2020-07-10 18:38:50,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 37 to 73 [2020-07-10 18:38:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:50,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:38:50,165 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:391) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:385) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:332) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:239) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:108) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:279) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 18:38:50,172 INFO L168 Benchmark]: Toolchain (without parser) took 2907.06 ms. Allocated memory was 144.7 MB in the beginning and 248.5 MB in the end (delta: 103.8 MB). Free memory was 103.1 MB in the beginning and 215.9 MB in the end (delta: -112.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:38:50,173 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 18:38:50,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.10 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 18:38:50,175 INFO L168 Benchmark]: Boogie Preprocessor took 30.04 ms. Allocated memory is still 144.7 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:38:50,176 INFO L168 Benchmark]: RCFGBuilder took 409.56 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.0 MB in the beginning and 164.2 MB in the end (delta: -72.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:38:50,177 INFO L168 Benchmark]: TraceAbstraction took 2217.67 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 163.5 MB in the beginning and 215.9 MB in the end (delta: -52.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:38:50,181 INFO L336 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.10 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.04 ms. Allocated memory is still 144.7 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 409.56 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.0 MB in the beginning and 164.2 MB in the end (delta: -72.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2217.67 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 163.5 MB in the beginning and 215.9 MB in the end (delta: -52.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...