/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/mannadiv.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:30:00,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:30:00,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:30:00,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:30:00,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:30:00,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:30:00,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:30:00,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:30:00,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:30:00,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:30:00,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:30:00,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:30:00,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:30:00,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:30:00,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:30:00,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:30:00,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:30:00,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:30:00,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:30:00,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:30:00,373 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:30:00,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:30:00,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:30:00,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:30:00,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:30:00,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:30:00,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:30:00,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:30:00,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:30:00,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:30:00,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:30:00,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:30:00,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:30:00,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:30:00,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:30:00,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:30:00,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:30:00,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:30:00,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:30:00,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:30:00,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:30:00,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:30:00,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:30:00,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:30:00,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:30:00,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:30:00,407 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:30:00,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:30:00,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:30:00,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:30:00,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:30:00,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:30:00,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:30:00,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:30:00,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:30:00,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:30:00,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:30:00,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:30:00,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:30:00,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:30:00,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:30:00,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:30:00,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:30:00,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:30:00,410 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:30:00,410 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:30:00,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:30:00,410 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:30:00,410 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:30:00,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:30:00,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:30:00,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:30:00,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:30:00,679 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:30:00,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/mannadiv.c [2022-04-08 04:30:00,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55497a208/bd933e358c82429a9a08f48779e641c3/FLAGe69fa4328 [2022-04-08 04:30:01,140 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:30:01,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c [2022-04-08 04:30:01,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55497a208/bd933e358c82429a9a08f48779e641c3/FLAGe69fa4328 [2022-04-08 04:30:01,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55497a208/bd933e358c82429a9a08f48779e641c3 [2022-04-08 04:30:01,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:30:01,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:30:01,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:30:01,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:30:01,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:30:01,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5795a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01, skipping insertion in model container [2022-04-08 04:30:01,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:30:01,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:30:01,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c[573,586] [2022-04-08 04:30:01,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:30:01,441 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:30:01,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c[573,586] [2022-04-08 04:30:01,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:30:01,479 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:30:01,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01 WrapperNode [2022-04-08 04:30:01,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:30:01,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:30:01,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:30:01,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:30:01,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:30:01,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:30:01,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:30:01,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:30:01,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (1/1) ... [2022-04-08 04:30:01,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:30:01,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:30:01,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:30:01,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:30:01,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:30:01,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:30:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:30:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:30:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:30:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:30:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:30:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:30:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:30:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:30:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:30:01,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:30:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:30:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:30:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:30:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:30:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:30:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:30:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:30:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:30:01,668 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:30:01,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:30:01,779 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:30:01,786 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:30:01,786 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:30:01,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:30:01 BoogieIcfgContainer [2022-04-08 04:30:01,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:30:01,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:30:01,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:30:01,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:30:01,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:30:01" (1/3) ... [2022-04-08 04:30:01,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fad2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:30:01, skipping insertion in model container [2022-04-08 04:30:01,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:30:01" (2/3) ... [2022-04-08 04:30:01,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fad2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:30:01, skipping insertion in model container [2022-04-08 04:30:01,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:30:01" (3/3) ... [2022-04-08 04:30:01,813 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv.c [2022-04-08 04:30:01,818 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:30:01,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:30:01,868 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:30:01,875 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:30:01,894 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:30:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:30:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:30:01,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:30:01,920 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:30:01,921 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:30:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:30:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 1 times [2022-04-08 04:30:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:30:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017686421] [2022-04-08 04:30:01,943 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:30:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 2 times [2022-04-08 04:30:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:30:01,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020313100] [2022-04-08 04:30:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:30:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:30:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:30:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:30:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:30:02,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 04:30:02,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 04:30:02,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-08 04:30:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:30:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:30:02,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 04:30:02,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 04:30:02,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 04:30:02,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-08 04:30:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 04:30:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:30:02,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 04:30:02,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 04:30:02,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 04:30:02,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-08 04:30:02,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:30:02,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 04:30:02,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 04:30:02,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-08 04:30:02,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 04:30:02,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-08 04:30:02,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {32#true} is VALID [2022-04-08 04:30:02,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 04:30:02,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 04:30:02,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 04:30:02,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-08 04:30:02,192 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {32#true} is VALID [2022-04-08 04:30:02,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 04:30:02,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 04:30:02,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 04:30:02,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-08 04:30:02,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {33#false} is VALID [2022-04-08 04:30:02,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 04:30:02,194 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {33#false} is VALID [2022-04-08 04:30:02,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 04:30:02,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 04:30:02,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 04:30:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 04:30:02,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:30:02,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020313100] [2022-04-08 04:30:02,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020313100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:30:02,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:30:02,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:30:02,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:30:02,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017686421] [2022-04-08 04:30:02,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017686421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:30:02,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:30:02,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:30:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054500098] [2022-04-08 04:30:02,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:30:02,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 04:30:02,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:30:02,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:30:02,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:02,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:30:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:30:02,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:30:02,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:30:02,272 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:30:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:02,364 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 04:30:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:30:02,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 04:30:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:30:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:30:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-08 04:30:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:30:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-08 04:30:02,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-04-08 04:30:02,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:02,460 INFO L225 Difference]: With dead ends: 51 [2022-04-08 04:30:02,460 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 04:30:02,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:30:02,466 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:30:02,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:30:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 04:30:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 04:30:02,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:30:02,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:30:02,494 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:30:02,494 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:30:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:02,499 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 04:30:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 04:30:02,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:30:02,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:30:02,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-08 04:30:02,501 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-08 04:30:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:02,504 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 04:30:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 04:30:02,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:30:02,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:30:02,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:30:02,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:30:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:30:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 04:30:02,509 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 04:30:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:30:02,509 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 04:30:02,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:30:02,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 04:30:02,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 04:30:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:30:02,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:30:02,542 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:30:02,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:30:02,543 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:30:02,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:30:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 1 times [2022-04-08 04:30:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:30:02,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1362790780] [2022-04-08 04:30:02,545 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:30:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 2 times [2022-04-08 04:30:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:30:02,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381756756] [2022-04-08 04:30:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:30:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:30:02,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:30:02,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123420069] [2022-04-08 04:30:02,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:30:02,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:30:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:30:02,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:30:02,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:30:02,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:30:02,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:30:02,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 04:30:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:30:02,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:30:02,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 04:30:02,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-08 04:30:02,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 04:30:02,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #66#return; {246#true} is VALID [2022-04-08 04:30:02,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret6 := main(); {246#true} is VALID [2022-04-08 04:30:02,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {246#true} is VALID [2022-04-08 04:30:02,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {246#true} is VALID [2022-04-08 04:30:02,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 04:30:02,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 04:30:02,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 04:30:02,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #58#return; {246#true} is VALID [2022-04-08 04:30:02,833 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {246#true} is VALID [2022-04-08 04:30:02,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 04:30:02,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 04:30:02,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 04:30:02,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #60#return; {246#true} is VALID [2022-04-08 04:30:02,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-08 04:30:02,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !false; {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-08 04:30:02,844 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:30:02,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:30:02,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 04:30:02,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 04:30:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 04:30:02,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:30:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:30:02,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381756756] [2022-04-08 04:30:02,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:30:02,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123420069] [2022-04-08 04:30:02,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123420069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:30:02,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:30:02,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:30:02,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:30:02,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1362790780] [2022-04-08 04:30:02,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1362790780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:30:02,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:30:02,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:30:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135250630] [2022-04-08 04:30:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:30:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 04:30:02,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:30:02,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:30:02,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:02,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:30:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:30:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:30:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:30:02,875 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:30:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:03,026 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 04:30:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:30:03,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 04:30:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:30:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:30:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 04:30:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:30:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 04:30:03,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 04:30:03,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:03,070 INFO L225 Difference]: With dead ends: 35 [2022-04-08 04:30:03,071 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 04:30:03,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:30:03,072 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:30:03,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:30:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 04:30:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-08 04:30:03,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:30:03,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:30:03,084 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:30:03,084 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:30:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:03,087 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-08 04:30:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-08 04:30:03,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:30:03,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:30:03,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-08 04:30:03,088 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-08 04:30:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:03,091 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-08 04:30:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-08 04:30:03,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:30:03,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:30:03,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:30:03,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:30:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:30:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-08 04:30:03,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-04-08 04:30:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:30:03,094 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-08 04:30:03,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:30:03,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-08 04:30:03,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-08 04:30:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 04:30:03,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:30:03,152 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:30:03,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 04:30:03,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:30:03,375 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:30:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:30:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 1 times [2022-04-08 04:30:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:30:03,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [82376721] [2022-04-08 04:30:03,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:30:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 2 times [2022-04-08 04:30:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:30:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258365261] [2022-04-08 04:30:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:30:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:30:03,392 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:30:03,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308480169] [2022-04-08 04:30:03,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:30:03,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:30:03,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:30:03,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:30:03,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:30:03,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:30:03,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:30:03,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 04:30:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:30:03,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:30:03,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-08 04:30:03,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {514#true} is VALID [2022-04-08 04:30:03,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 04:30:03,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #66#return; {514#true} is VALID [2022-04-08 04:30:03,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret6 := main(); {514#true} is VALID [2022-04-08 04:30:03,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {514#true} is VALID [2022-04-08 04:30:03,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {514#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {514#true} is VALID [2022-04-08 04:30:03,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 04:30:03,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 04:30:03,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 04:30:03,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {514#true} {514#true} #58#return; {514#true} is VALID [2022-04-08 04:30:03,703 INFO L272 TraceCheckUtils]: 11: Hoare triple {514#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {514#true} is VALID [2022-04-08 04:30:03,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 04:30:03,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 04:30:03,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 04:30:03,704 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {514#true} {514#true} #60#return; {514#true} is VALID [2022-04-08 04:30:03,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {514#true} is VALID [2022-04-08 04:30:03,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#true} assume !false; {514#true} is VALID [2022-04-08 04:30:03,705 INFO L272 TraceCheckUtils]: 18: Hoare triple {514#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {514#true} is VALID [2022-04-08 04:30:03,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {514#true} ~cond := #in~cond; {576#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:30:03,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {576#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:30:03,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:30:03,708 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} {514#true} #62#return; {587#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-08 04:30:03,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-08 04:30:03,709 INFO L272 TraceCheckUtils]: 24: Hoare triple {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:30:03,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:30:03,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2022-04-08 04:30:03,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-08 04:30:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 04:30:03,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:30:10,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-08 04:30:10,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2022-04-08 04:30:10,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:30:10,260 INFO L272 TraceCheckUtils]: 24: Hoare triple {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:30:10,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {618#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-08 04:30:10,261 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} {514#true} #62#return; {618#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-08 04:30:10,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:30:10,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {631#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:30:10,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {514#true} ~cond := #in~cond; {631#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:30:10,263 INFO L272 TraceCheckUtils]: 18: Hoare triple {514#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {514#true} is VALID [2022-04-08 04:30:10,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#true} assume !false; {514#true} is VALID [2022-04-08 04:30:10,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {514#true} is VALID [2022-04-08 04:30:10,263 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {514#true} {514#true} #60#return; {514#true} is VALID [2022-04-08 04:30:10,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 04:30:10,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 04:30:10,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 04:30:10,264 INFO L272 TraceCheckUtils]: 11: Hoare triple {514#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {514#true} is VALID [2022-04-08 04:30:10,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {514#true} {514#true} #58#return; {514#true} is VALID [2022-04-08 04:30:10,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 04:30:10,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 04:30:10,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 04:30:10,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {514#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {514#true} is VALID [2022-04-08 04:30:10,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {514#true} is VALID [2022-04-08 04:30:10,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret6 := main(); {514#true} is VALID [2022-04-08 04:30:10,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #66#return; {514#true} is VALID [2022-04-08 04:30:10,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 04:30:10,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {514#true} is VALID [2022-04-08 04:30:10,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-08 04:30:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 04:30:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:30:10,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258365261] [2022-04-08 04:30:10,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:30:10,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308480169] [2022-04-08 04:30:10,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308480169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:30:10,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:30:10,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 04:30:10,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:30:10,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [82376721] [2022-04-08 04:30:10,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [82376721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:30:10,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:30:10,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:30:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246182839] [2022-04-08 04:30:10,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:30:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 04:30:10,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:30:10,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 04:30:10,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:10,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:30:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:30:10,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:30:10,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:30:10,298 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 04:30:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:10,518 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-08 04:30:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:30:10,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 04:30:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:30:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 04:30:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 04:30:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 04:30:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 04:30:10,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-08 04:30:10,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:10,550 INFO L225 Difference]: With dead ends: 30 [2022-04-08 04:30:10,551 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 04:30:10,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:30:10,552 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:30:10,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:30:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 04:30:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 04:30:10,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:30:10,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:30:10,553 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:30:10,554 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:30:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:10,554 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:30:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:30:10,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:30:10,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:30:10,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 04:30:10,554 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 04:30:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:30:10,555 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:30:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:30:10,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:30:10,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:30:10,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:30:10,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:30:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:30:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 04:30:10,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-08 04:30:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:30:10,556 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 04:30:10,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 04:30:10,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 04:30:10,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:30:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:30:10,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:30:10,558 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 04:30:10,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:30:10,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 04:30:10,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 04:30:10,894 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-08 04:30:10,894 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-08 04:30:10,895 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-08 04:30:10,895 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-08 04:30:10,895 INFO L885 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-04-08 04:30:10,895 INFO L885 garLoopResultBuilder]: At program point L13-2(lines 12 14) the Hoare annotation is: true [2022-04-08 04:30:10,895 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: true [2022-04-08 04:30:10,895 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 48) the Hoare annotation is: (let ((.cse0 (* main_~x2~0 main_~y1~0))) (and (= (+ .cse0 main_~y3~0 main_~y2~0) main_~x1~0) (= (+ .cse0 main_~y2~0) main_~x1~0))) [2022-04-08 04:30:10,895 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-08 04:30:10,896 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 51) the Hoare annotation is: true [2022-04-08 04:30:10,897 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 51) the Hoare annotation is: true [2022-04-08 04:30:10,897 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 47) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 04:30:10,897 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 35 48) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 04:30:10,897 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 04:30:10,897 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 35 48) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 04:30:10,897 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 51) the Hoare annotation is: true [2022-04-08 04:30:10,897 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-08 04:30:10,897 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-08 04:30:10,897 INFO L885 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2022-04-08 04:30:10,898 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:30:10,898 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 04:30:10,898 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:30:10,898 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:30:10,898 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 04:30:10,898 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:30:10,898 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:30:10,898 INFO L878 garLoopResultBuilder]: At program point L17(lines 17 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 04:30:10,898 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 04:30:10,898 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-08 04:30:10,899 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 04:30:10,899 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 04:30:10,899 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 04:30:10,902 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 04:30:10,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 04:30:10,909 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:30:10,910 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 04:30:10,919 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 04:30:10,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 04:30:10 BoogieIcfgContainer [2022-04-08 04:30:10,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 04:30:10,932 INFO L158 Benchmark]: Toolchain (without parser) took 9758.38ms. Allocated memory was 191.9MB in the beginning and 280.0MB in the end (delta: 88.1MB). Free memory was 134.2MB in the beginning and 166.3MB in the end (delta: -32.0MB). Peak memory consumption was 56.8MB. Max. memory is 8.0GB. [2022-04-08 04:30:10,932 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:30:10,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.80ms. Allocated memory was 191.9MB in the beginning and 280.0MB in the end (delta: 88.1MB). Free memory was 134.1MB in the beginning and 251.2MB in the end (delta: -117.1MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-08 04:30:10,934 INFO L158 Benchmark]: Boogie Preprocessor took 41.88ms. Allocated memory is still 280.0MB. Free memory was 251.2MB in the beginning and 249.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:30:10,934 INFO L158 Benchmark]: RCFGBuilder took 274.20ms. Allocated memory is still 280.0MB. Free memory was 249.6MB in the beginning and 238.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:30:10,936 INFO L158 Benchmark]: TraceAbstraction took 9130.05ms. Allocated memory is still 280.0MB. Free memory was 237.6MB in the beginning and 166.3MB in the end (delta: 71.3MB). Peak memory consumption was 70.8MB. Max. memory is 8.0GB. [2022-04-08 04:30:10,937 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 305.80ms. Allocated memory was 191.9MB in the beginning and 280.0MB in the end (delta: 88.1MB). Free memory was 134.1MB in the beginning and 251.2MB in the end (delta: -117.1MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.88ms. Allocated memory is still 280.0MB. Free memory was 251.2MB in the beginning and 249.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.20ms. Allocated memory is still 280.0MB. Free memory was 249.6MB in the beginning and 238.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9130.05ms. Allocated memory is still 280.0MB. Free memory was 237.6MB in the beginning and 166.3MB in the end (delta: 71.3MB). Peak memory consumption was 70.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 67 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 61 PreInvPairs, 87 NumberOfFragments, 105 HoareAnnotationTreeSize, 61 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: x2 * y1 + y3 + y2 == x1 - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-08 04:30:10,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...