java -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/xor5.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:01:20,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:01:20,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:01:20,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:01:20,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:01:21,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:01:21,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:01:21,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:01:21,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:01:21,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:01:21,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:01:21,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:01:21,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:01:21,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:01:21,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:01:21,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:01:21,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:01:21,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:01:21,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:01:21,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:01:21,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:01:21,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:01:21,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:01:21,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:01:21,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:01:21,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:01:21,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:01:21,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:01:21,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:01:21,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:01:21,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:01:21,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:01:21,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:01:21,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:01:21,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:01:21,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:01:21,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:01:21,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:01:21,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:01:21,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:01:21,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:01:21,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:01:21,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:01:21,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:01:21,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:01:21,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:01:21,103 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:01:21,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:01:21,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:01:21,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:01:21,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:01:21,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:01:21,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:01:21,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:01:21,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:01:21,105 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:01:21,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:01:21,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:01:21,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:01:21,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:01:21,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:01:21,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:01:21,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:01:21,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:01:21,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:01:21,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:01:21,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:01:21,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:01:21,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:01:21,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:01:21,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:01:21,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:01:21,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:01:21,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:01:21,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:01:21,455 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:01:21,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor5.i [2019-10-06 23:01:21,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653a14a59/73c367aedc97479f81b8f648471e719d/FLAG56b712c22 [2019-10-06 23:01:22,009 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:01:22,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor5.i [2019-10-06 23:01:22,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653a14a59/73c367aedc97479f81b8f648471e719d/FLAG56b712c22 [2019-10-06 23:01:22,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653a14a59/73c367aedc97479f81b8f648471e719d [2019-10-06 23:01:22,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:01:22,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:01:22,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:01:22,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:01:22,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:01:22,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef43f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22, skipping insertion in model container [2019-10-06 23:01:22,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,443 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:01:22,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:01:22,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:01:22,748 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:01:22,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:01:22,903 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:01:22,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22 WrapperNode [2019-10-06 23:01:22,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:01:22,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:01:22,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:01:22,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:01:22,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (1/1) ... [2019-10-06 23:01:22,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:01:22,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:01:22,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:01:22,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:01:22,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (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 [2019-10-06 23:01:23,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:01:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:01:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2019-10-06 23:01:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:01:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:01:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:01:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2019-10-06 23:01:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:01:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:01:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:01:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:01:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:01:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:01:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:01:23,399 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:01:23,400 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:01:23,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:01:23 BoogieIcfgContainer [2019-10-06 23:01:23,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:01:23,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:01:23,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:01:23,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:01:23,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:01:22" (1/3) ... [2019-10-06 23:01:23,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f75e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:01:23, skipping insertion in model container [2019-10-06 23:01:23,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:22" (2/3) ... [2019-10-06 23:01:23,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f75e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:01:23, skipping insertion in model container [2019-10-06 23:01:23,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:01:23" (3/3) ... [2019-10-06 23:01:23,411 INFO L109 eAbstractionObserver]: Analyzing ICFG xor5.i [2019-10-06 23:01:23,433 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:01:23,445 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:01:23,457 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:01:23,487 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:01:23,487 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:01:23,487 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:01:23,487 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:01:23,488 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:01:23,488 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:01:23,488 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:01:23,488 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:01:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-06 23:01:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-06 23:01:23,509 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:23,510 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:23,512 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:23,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1813361058, now seen corresponding path program 1 times [2019-10-06 23:01:23,524 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:23,525 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:23,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:23,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:01:23,758 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:23,759 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:01:23,761 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:01:23,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:01:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:01:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:01:23,784 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-06 23:01:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:23,869 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-06 23:01:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:01:23,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-06 23:01:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:23,879 INFO L225 Difference]: With dead ends: 44 [2019-10-06 23:01:23,880 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:01:23,883 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:01:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:01:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:01:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:01:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:01:23,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-06 23:01:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:23,922 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:01:23,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:01:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:01:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:01:23,924 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:23,925 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:23,925 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash 796647951, now seen corresponding path program 1 times [2019-10-06 23:01:23,926 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:23,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:23,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:23,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:24,035 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:24,035 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:24,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:01:24,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:01:24,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:01:24,282 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:24,311 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:01:24,311 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:24,318 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:24,327 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:24,328 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:24,550 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:01:26,357 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs [2019-10-06 23:01:26,365 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:26,373 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:26,373 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:26,374 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 444#(and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~i~2 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) [2019-10-06 23:01:26,374 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 524#(and (= |xor_#in~x.offset| xor_~x.offset) (= |xor_#in~x.base| xor_~x.base) (= 1 xor_~i~0) (<= ~N~0 1) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= xor_~i~0 1) (not (< xor_~i~0 ~N~0)) (= xor_~res~0 (select (select |#memory_int| xor_~x.base) xor_~x.offset))) [2019-10-06 23:01:26,374 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 38#(and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:01:26,375 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 528#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:01:26,375 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 519#(and (= |xor_#in~x.offset| xor_~x.offset) (= |xor_#in~x.base| xor_~x.base) (= 1 xor_~i~0) (<= 1 xor_~i~0) (<= xor_~i~0 1) (= xor_~res~0 (select (select |#memory_int| xor_~x.base) xor_~x.offset))) [2019-10-06 23:01:26,375 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 96#(and (or (and (not (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647)) (= |main_#t~ret6| (+ (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) (- 4294967296))) (not (< main_~i~1 ~N~0))) (and (not (< main_~i~1 ~N~0)) (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647) (= |main_#t~ret6| (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296)))) (<= ~N~0 1)) [2019-10-06 23:01:26,375 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 327#(and (or (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (not (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647)) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret5~0 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= 0 (+ main_~ret5~0 2147483648)) (<= main_~ret~0 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (+ (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) (- 4294967296))) (<= main_~i~2 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret5~0 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= 0 (+ main_~ret5~0 2147483648)) (<= main_~ret~0 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296)) (<= main_~i~2 0) (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0))) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2)) [2019-10-06 23:01:26,376 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 271#(and (<= 0 (+ main_~ret2~0 2147483648)) (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret5~0 2147483647) (<= main_~i~2 0) (<= 0 (+ main_~ret5~0 2147483648)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2) (= main_~i~2 0)) [2019-10-06 23:01:26,376 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0)) [2019-10-06 23:01:26,376 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 514#true [2019-10-06 23:01:26,376 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 500#(and (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret~0 2147483647)) [2019-10-06 23:01:26,377 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 483#(and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~i~2 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2) (= main_~i~2 0)) [2019-10-06 23:01:26,377 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true [2019-10-06 23:01:26,378 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 505#(and (or (and (not (< main_~i~1 ~N~0)) (= (mod main_~temp~0 4294967296) main_~ret~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod main_~temp~0 4294967296) 2147483647)) (and (not (< main_~i~1 ~N~0)) (= (mod main_~temp~0 4294967296) (+ main_~ret~0 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (< 2147483647 (mod main_~temp~0 4294967296)))) (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret~0 2147483647)) [2019-10-06 23:01:26,379 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:01:26,380 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 ~N~0) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:01:26,380 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 533#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:01:26,381 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 210#(and (<= 0 (+ main_~ret2~0 2147483648)) (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret5~0 2147483647) (<= main_~i~2 0) (<= 0 (+ main_~ret5~0 2147483648)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2) (= main_~i~2 0)) [2019-10-06 23:01:26,381 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:26,382 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 374#(and (or (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= |main_#t~ret13| (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (not (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= |main_#t~ret13| (+ (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0))) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~i~2 0) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2)) [2019-10-06 23:01:27,358 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-06 23:01:27,563 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-06 23:01:27,567 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:27,568 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 17] total 25 [2019-10-06 23:01:27,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:01:27,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:01:27,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:01:27,576 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 25 states. [2019-10-06 23:01:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:27,860 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-10-06 23:01:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-06 23:01:27,860 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-10-06 23:01:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:27,862 INFO L225 Difference]: With dead ends: 36 [2019-10-06 23:01:27,862 INFO L226 Difference]: Without dead ends: 23 [2019-10-06 23:01:27,863 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:01:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-06 23:01:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-06 23:01:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-06 23:01:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-06 23:01:27,870 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2019-10-06 23:01:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:27,870 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-06 23:01:27,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:01:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-06 23:01:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:01:27,872 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:27,872 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:28,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:28,086 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1365141180, now seen corresponding path program 1 times [2019-10-06 23:01:28,086 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:28,086 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:28,086 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:28,087 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-06 23:01:28,217 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:28,218 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:01:28,218 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:01:28,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:01:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:01:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:01:28,220 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-10-06 23:01:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:28,255 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-10-06 23:01:28,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:01:28,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-06 23:01:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:28,257 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:01:28,258 INFO L226 Difference]: Without dead ends: 24 [2019-10-06 23:01:28,259 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:01:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-06 23:01:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-06 23:01:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:01:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-10-06 23:01:28,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2019-10-06 23:01:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:28,270 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-06 23:01:28,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:01:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-10-06 23:01:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-06 23:01:28,272 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:28,272 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:28,272 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 765366277, now seen corresponding path program 1 times [2019-10-06 23:01:28,273 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:28,273 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:28,273 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:28,274 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-06 23:01:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-06 23:01:28,503 INFO L161 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-06 23:01:28,503 INFO L451 BasicCegarLoop]: Counterexample might be feasible [2019-10-06 23:01:28,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 11:01:28 BoogieIcfgContainer [2019-10-06 23:01:28,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-06 23:01:28,563 INFO L168 Benchmark]: Toolchain (without parser) took 6138.76 ms. Allocated memory was 136.8 MB in the beginning and 291.0 MB in the end (delta: 154.1 MB). Free memory was 101.1 MB in the beginning and 223.9 MB in the end (delta: -122.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-10-06 23:01:28,564 INFO L168 Benchmark]: CDTParser took 1.02 ms. Allocated memory is still 136.8 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-06 23:01:28,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.11 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 180.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-06 23:01:28,565 INFO L168 Benchmark]: Boogie Preprocessor took 42.80 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 177.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-06 23:01:28,566 INFO L168 Benchmark]: RCFGBuilder took 453.64 ms. Allocated memory is still 200.8 MB. Free memory was 177.6 MB in the beginning and 156.1 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-10-06 23:01:28,567 INFO L168 Benchmark]: TraceAbstraction took 5158.54 ms. Allocated memory was 200.8 MB in the beginning and 291.0 MB in the end (delta: 90.2 MB). Free memory was 156.1 MB in the beginning and 223.9 MB in the end (delta: -67.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-10-06 23:01:28,570 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02 ms. Allocated memory is still 136.8 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 479.11 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 180.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.80 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 177.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 453.64 ms. Allocated memory is still 200.8 MB. Free memory was 177.6 MB in the beginning and 156.1 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5158.54 ms. Allocated memory was 200.8 MB in the beginning and 291.0 MB in the end (delta: 90.2 MB). Free memory was 156.1 MB in the beginning and 223.9 MB in the end (delta: -67.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 14. Possible FailurePath: [L6] int N; [L21] N = __VERIFIER_nondet_int() [L22] COND TRUE N > 1 [L23] int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; [L29] int i = 0; VAL [\old(N)=0, i=0, N=2, x={1:0}] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [\old(N)=0, i=1, N=2, x={1:0}] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}] [L29] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={1:0}] [L34] CALL, EXPR xor(x) VAL [\old(N)=0, N=2, x={1:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=0, x={1:0}, x={1:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res ^ x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L13] COND FALSE !(i < N) [L16] return res; [L34] RET, EXPR xor(x) VAL [\old(N)=0, i=2, N=2, x={1:0}, xor(x)=0] [L34] ret = xor(x) [L36] EXPR x[0] [L36] temp=x[0] [L36] EXPR x[1] [L36] x[0] = x[1] [L36] x[1] = temp VAL [\old(N)=0, i=2, N=2, ret=0, temp=0, x={1:0}] [L37] CALL, EXPR xor(x) VAL [\old(N)=0, N=2, x={1:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=1, x={1:0}, x={1:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res ^ x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L13] COND FALSE !(i < N) [L16] return res; [L37] RET, EXPR xor(x) VAL [\old(N)=0, i=2, N=2, ret=0, temp=0, x={1:0}, xor(x)=-2] [L37] ret2 = xor(x) [L38] EXPR x[0] [L38] temp=x[0] [L39] int i =0 ; VAL [\old(N)=0, i=2, i=0, N=2, ret=0, ret2=-2, temp=1, x={1:0}] [L39] COND TRUE i