/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/array-fpi/condmf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:20:54,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:54,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:54,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:54,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:54,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:54,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:54,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:54,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:54,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:54,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:54,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:54,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:54,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:54,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:54,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:54,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:54,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:54,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:54,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:54,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:54,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:54,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:54,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:54,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:54,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:54,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:54,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:54,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:54,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:54,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:54,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:54,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:54,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:54,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:54,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:54,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:54,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:54,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:54,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:54,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:54,578 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 20:20:54,589 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:54,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:54,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:54,591 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:54,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:54,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:54,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:54,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:54,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:54,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:54,593 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:54,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:54,593 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:54,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:54,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:54,594 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:54,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:54,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:54,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:54,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:54,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:54,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:54,595 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:54,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:54,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:54,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:54,980 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:54,980 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:54,981 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condmf.c [2020-07-10 20:20:55,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa88ec71/1f5f89925118401f9a2894bc9cb42ba2/FLAG4815a19ed [2020-07-10 20:20:55,642 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:55,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condmf.c [2020-07-10 20:20:55,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa88ec71/1f5f89925118401f9a2894bc9cb42ba2/FLAG4815a19ed [2020-07-10 20:20:55,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa88ec71/1f5f89925118401f9a2894bc9cb42ba2 [2020-07-10 20:20:55,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:55,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:55,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:55,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:56,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:56,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:55" (1/1) ... [2020-07-10 20:20:56,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b04fb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56, skipping insertion in model container [2020-07-10 20:20:56,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:55" (1/1) ... [2020-07-10 20:20:56,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:56,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:56,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:56,248 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:56,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:56,293 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:56,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56 WrapperNode [2020-07-10 20:20:56,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:56,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:56,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:56,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:56,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (1/1) ... [2020-07-10 20:20:56,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (1/1) ... [2020-07-10 20:20:56,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (1/1) ... [2020-07-10 20:20:56,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (1/1) ... [2020-07-10 20:20:56,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (1/1) ... [2020-07-10 20:20:56,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (1/1) ... [2020-07-10 20:20:56,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (1/1) ... [2020-07-10 20:20:56,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:56,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:56,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:56,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:56,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (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 20:20:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:20:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:20:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:20:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:20:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:20:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:20:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:20:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:20:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:57,027 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:57,028 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:20:57,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:57 BoogieIcfgContainer [2020-07-10 20:20:57,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:57,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:57,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:57,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:57,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:55" (1/3) ... [2020-07-10 20:20:57,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67187a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:57, skipping insertion in model container [2020-07-10 20:20:57,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:56" (2/3) ... [2020-07-10 20:20:57,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67187a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:57, skipping insertion in model container [2020-07-10 20:20:57,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:57" (3/3) ... [2020-07-10 20:20:57,043 INFO L109 eAbstractionObserver]: Analyzing ICFG condmf.c [2020-07-10 20:20:57,056 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:57,065 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:57,079 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:57,105 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:57,105 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:57,106 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:57,106 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:57,106 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:57,107 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:57,107 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:57,107 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-10 20:20:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:20:57,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:57,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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 20:20:57,137 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash 246632013, now seen corresponding path program 1 times [2020-07-10 20:20:57,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:57,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2069577209] [2020-07-10 20:20:57,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:57,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-10 20:20:57,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-10 20:20:57,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-10 20:20:57,398 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-10 20:20:57,399 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:57,400 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #110#return; {62#true} is VALID [2020-07-10 20:20:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:57,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-10 20:20:57,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-10 20:20:57,413 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:57,414 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #106#return; {62#true} is VALID [2020-07-10 20:20:57,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:57,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-10 20:20:57,417 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-10 20:20:57,418 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-10 20:20:57,418 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-10 20:20:57,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:57,419 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #110#return; {62#true} is VALID [2020-07-10 20:20:57,419 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret8 := main(); {62#true} is VALID [2020-07-10 20:20:57,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-10 20:20:57,420 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-10 20:20:57,421 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-10 20:20:57,421 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-10 20:20:57,422 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-10 20:20:57,422 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-10 20:20:57,422 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-10 20:20:57,423 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:57,423 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #106#return; {62#true} is VALID [2020-07-10 20:20:57,424 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-10 20:20:57,424 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {62#true} is VALID [2020-07-10 20:20:57,425 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-10 20:20:57,425 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-10 20:20:57,427 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-10 20:20:57,428 INFO L280 TraceCheckUtils]: 22: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-10 20:20:57,428 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-10 20:20:57,428 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-10 20:20:57,429 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} assume !!(~i~0 < ~N~0); {63#false} is VALID [2020-07-10 20:20:57,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {63#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L47 {63#false} is VALID [2020-07-10 20:20:57,430 INFO L263 TraceCheckUtils]: 27: Hoare triple {63#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {63#false} is VALID [2020-07-10 20:20:57,430 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-10 20:20:57,431 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-10 20:20:57,431 INFO L280 TraceCheckUtils]: 30: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-10 20:20:57,436 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 20:20:57,436 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:57,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2069577209] [2020-07-10 20:20:57,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:57,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:20:57,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415627062] [2020-07-10 20:20:57,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:20:57,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:57,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:20:57,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:57,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:20:57,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:20:57,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:57,541 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-10 20:20:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:58,025 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2020-07-10 20:20:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:20:58,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:20:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-10 20:20:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-10 20:20:58,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2020-07-10 20:20:58,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:58,241 INFO L225 Difference]: With dead ends: 101 [2020-07-10 20:20:58,242 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 20:20:58,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 20:20:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-10 20:20:58,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:58,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-10 20:20:58,366 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 20:20:58,366 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 20:20:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:58,373 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-10 20:20:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 20:20:58,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:58,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:58,375 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 20:20:58,375 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 20:20:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:58,381 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-10 20:20:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 20:20:58,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:58,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:58,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:58,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 20:20:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-07-10 20:20:58,389 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 31 [2020-07-10 20:20:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:58,390 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-07-10 20:20:58,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:20:58,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 55 transitions. [2020-07-10 20:20:58,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 20:20:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:20:58,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:58,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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 20:20:58,473 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:58,473 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2015253558, now seen corresponding path program 1 times [2020-07-10 20:20:58,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:58,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [802682698] [2020-07-10 20:20:58,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {501#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {487#true} is VALID [2020-07-10 20:20:58,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {487#true} #valid := #valid[0 := 0]; {487#true} is VALID [2020-07-10 20:20:58,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {487#true} assume 0 < #StackHeapBarrier; {487#true} is VALID [2020-07-10 20:20:58,647 INFO L280 TraceCheckUtils]: 3: Hoare triple {487#true} ~N~0 := 0; {487#true} is VALID [2020-07-10 20:20:58,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {487#true} assume true; {487#true} is VALID [2020-07-10 20:20:58,647 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {487#true} {487#true} #110#return; {487#true} is VALID [2020-07-10 20:20:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {487#true} ~cond := #in~cond; {487#true} is VALID [2020-07-10 20:20:58,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {487#true} assume !(0 == ~cond); {487#true} is VALID [2020-07-10 20:20:58,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2020-07-10 20:20:58,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {487#true} {495#(<= 1 ~N~0)} #106#return; {495#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:58,665 INFO L263 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {501#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:58,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {501#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {487#true} is VALID [2020-07-10 20:20:58,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {487#true} #valid := #valid[0 := 0]; {487#true} is VALID [2020-07-10 20:20:58,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {487#true} assume 0 < #StackHeapBarrier; {487#true} is VALID [2020-07-10 20:20:58,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {487#true} ~N~0 := 0; {487#true} is VALID [2020-07-10 20:20:58,666 INFO L280 TraceCheckUtils]: 5: Hoare triple {487#true} assume true; {487#true} is VALID [2020-07-10 20:20:58,667 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {487#true} {487#true} #110#return; {487#true} is VALID [2020-07-10 20:20:58,667 INFO L263 TraceCheckUtils]: 7: Hoare triple {487#true} call #t~ret8 := main(); {487#true} is VALID [2020-07-10 20:20:58,668 INFO L280 TraceCheckUtils]: 8: Hoare triple {487#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {487#true} is VALID [2020-07-10 20:20:58,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {487#true} ~N~0 := #t~nondet0; {487#true} is VALID [2020-07-10 20:20:58,668 INFO L280 TraceCheckUtils]: 10: Hoare triple {487#true} havoc #t~nondet0; {487#true} is VALID [2020-07-10 20:20:58,669 INFO L280 TraceCheckUtils]: 11: Hoare triple {487#true} assume !(~N~0 <= 0); {495#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:58,670 INFO L263 TraceCheckUtils]: 12: Hoare triple {495#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {487#true} is VALID [2020-07-10 20:20:58,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {487#true} ~cond := #in~cond; {487#true} is VALID [2020-07-10 20:20:58,670 INFO L280 TraceCheckUtils]: 14: Hoare triple {487#true} assume !(0 == ~cond); {487#true} is VALID [2020-07-10 20:20:58,671 INFO L280 TraceCheckUtils]: 15: Hoare triple {487#true} assume true; {487#true} is VALID [2020-07-10 20:20:58,672 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {487#true} {495#(<= 1 ~N~0)} #106#return; {495#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:58,673 INFO L280 TraceCheckUtils]: 17: Hoare triple {495#(<= 1 ~N~0)} havoc ~i~0; {495#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:58,674 INFO L280 TraceCheckUtils]: 18: Hoare triple {495#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {495#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:58,675 INFO L280 TraceCheckUtils]: 19: Hoare triple {495#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {495#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:58,676 INFO L280 TraceCheckUtils]: 20: Hoare triple {495#(<= 1 ~N~0)} ~i~0 := 0; {500#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:20:58,677 INFO L280 TraceCheckUtils]: 21: Hoare triple {500#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {488#false} is VALID [2020-07-10 20:20:58,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {488#false} ~i~0 := 0; {488#false} is VALID [2020-07-10 20:20:58,678 INFO L280 TraceCheckUtils]: 23: Hoare triple {488#false} assume !(~i~0 < ~N~0); {488#false} is VALID [2020-07-10 20:20:58,678 INFO L280 TraceCheckUtils]: 24: Hoare triple {488#false} ~i~0 := 0; {488#false} is VALID [2020-07-10 20:20:58,678 INFO L280 TraceCheckUtils]: 25: Hoare triple {488#false} assume !!(~i~0 < ~N~0); {488#false} is VALID [2020-07-10 20:20:58,679 INFO L280 TraceCheckUtils]: 26: Hoare triple {488#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L47 {488#false} is VALID [2020-07-10 20:20:58,679 INFO L263 TraceCheckUtils]: 27: Hoare triple {488#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {488#false} is VALID [2020-07-10 20:20:58,679 INFO L280 TraceCheckUtils]: 28: Hoare triple {488#false} ~cond := #in~cond; {488#false} is VALID [2020-07-10 20:20:58,680 INFO L280 TraceCheckUtils]: 29: Hoare triple {488#false} assume 0 == ~cond; {488#false} is VALID [2020-07-10 20:20:58,680 INFO L280 TraceCheckUtils]: 30: Hoare triple {488#false} assume !false; {488#false} is VALID [2020-07-10 20:20:58,682 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 20:20:58,682 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:58,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [802682698] [2020-07-10 20:20:58,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:58,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:58,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437950776] [2020-07-10 20:20:58,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:20:58,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:58,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:58,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:58,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:58,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:58,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:58,726 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2020-07-10 20:20:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:59,365 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2020-07-10 20:20:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:20:59,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:20:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2020-07-10 20:20:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2020-07-10 20:20:59,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 107 transitions. [2020-07-10 20:20:59,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:59,530 INFO L225 Difference]: With dead ends: 98 [2020-07-10 20:20:59,530 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 20:20:59,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:20:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 20:20:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2020-07-10 20:20:59,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:59,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 54 states. [2020-07-10 20:20:59,630 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 54 states. [2020-07-10 20:20:59,631 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 54 states. [2020-07-10 20:20:59,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:59,637 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-10 20:20:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2020-07-10 20:20:59,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:59,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:59,638 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 72 states. [2020-07-10 20:20:59,639 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 72 states. [2020-07-10 20:20:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:59,643 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-10 20:20:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2020-07-10 20:20:59,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:59,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:59,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:59,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 20:20:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-07-10 20:20:59,649 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 31 [2020-07-10 20:20:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:59,649 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-07-10 20:20:59,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:20:59,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2020-07-10 20:20:59,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-07-10 20:20:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 20:20:59,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:59,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:20:59,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:59,730 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1554786686, now seen corresponding path program 1 times [2020-07-10 20:20:59,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:59,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246465803] [2020-07-10 20:20:59,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:59,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:59,780 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) 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 20:20:59,797 INFO L168 Benchmark]: Toolchain (without parser) took 3801.56 ms. Allocated memory was 143.1 MB in the beginning and 252.7 MB in the end (delta: 109.6 MB). Free memory was 100.9 MB in the beginning and 138.6 MB in the end (delta: -37.7 MB). Peak memory consumption was 71.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:59,798 INFO L168 Benchmark]: CDTParser took 1.19 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:20:59,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.44 ms. Allocated memory is still 143.1 MB. Free memory was 100.7 MB in the beginning and 89.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:59,801 INFO L168 Benchmark]: Boogie Preprocessor took 129.34 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 89.9 MB in the beginning and 177.8 MB in the end (delta: -87.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:59,803 INFO L168 Benchmark]: RCFGBuilder took 609.37 ms. Allocated memory is still 199.8 MB. Free memory was 177.1 MB in the beginning and 149.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:59,804 INFO L168 Benchmark]: TraceAbstraction took 2755.70 ms. Allocated memory was 199.8 MB in the beginning and 252.7 MB in the end (delta: 53.0 MB). Free memory was 149.4 MB in the beginning and 138.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:59,814 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 1.19 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.44 ms. Allocated memory is still 143.1 MB. Free memory was 100.7 MB in the beginning and 89.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.34 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 89.9 MB in the beginning and 177.8 MB in the end (delta: -87.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 609.37 ms. Allocated memory is still 199.8 MB. Free memory was 177.1 MB in the beginning and 149.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2755.70 ms. Allocated memory was 199.8 MB in the beginning and 252.7 MB in the end (delta: 53.0 MB). Free memory was 149.4 MB in the beginning and 138.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...