./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:42:27,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:42:27,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:42:27,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:42:27,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:42:27,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:42:27,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:42:27,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:42:27,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:42:27,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:42:27,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:42:27,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:42:27,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:42:27,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:42:27,131 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:42:27,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:42:27,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:42:27,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:42:27,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:42:27,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:42:27,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:42:27,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:42:27,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:42:27,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:42:27,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:42:27,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:42:27,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:42:27,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:42:27,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:42:27,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:42:27,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:42:27,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:42:27,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:42:27,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:42:27,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:42:27,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:42:27,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:42:27,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:42:27,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:42:27,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:42:27,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:42:27,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:42:27,146 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 [2024-11-20 07:42:27,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:42:27,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:42:27,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:42:27,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:42:27,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:42:27,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-11-20 07:42:28,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:42:29,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:42:29,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-11-20 07:42:29,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d011a40fa/cd3f0f7643ed4723bd00243d256ba226/FLAGca2271750 [2024-11-20 07:42:29,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d011a40fa/cd3f0f7643ed4723bd00243d256ba226 [2024-11-20 07:42:29,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:42:29,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:42:29,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:42:29,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:42:29,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:42:29,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a0116a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29, skipping insertion in model container [2024-11-20 07:42:29,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:42:29,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-11-20 07:42:29,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:42:29,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:42:29,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-11-20 07:42:29,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:42:29,399 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:42:29,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29 WrapperNode [2024-11-20 07:42:29,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:42:29,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:42:29,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:42:29,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:42:29,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,452 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-20 07:42:29,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:42:29,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:42:29,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:42:29,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:42:29,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:42:29,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:42:29,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:42:29,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:42:29,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:42:29,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (1/1) ... [2024-11-20 07:42:29,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:42:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:42:29,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:42:29,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:42:29,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:42:29,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:42:29,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:42:29,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:42:29,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:42:29,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:42:29,654 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:42:29,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:42:29,868 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 07:42:29,869 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:42:29,880 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:42:29,881 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:42:29,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:42:29 BoogieIcfgContainer [2024-11-20 07:42:29,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:42:29,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:42:29,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:42:29,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:42:29,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:42:29" (1/3) ... [2024-11-20 07:42:29,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3967cc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:42:29, skipping insertion in model container [2024-11-20 07:42:29,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:29" (2/3) ... [2024-11-20 07:42:29,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3967cc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:42:29, skipping insertion in model container [2024-11-20 07:42:29,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:42:29" (3/3) ... [2024-11-20 07:42:29,893 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-33.i [2024-11-20 07:42:29,905 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:42:29,905 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:42:29,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:42:29,967 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5cfe3c6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:42:29,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:42:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 07:42:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-20 07:42:29,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:29,983 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:29,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:29,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash -981592420, now seen corresponding path program 1 times [2024-11-20 07:42:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155922794] [2024-11-20 07:42:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:42:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:42:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:42:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:42:30,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:30,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155922794] [2024-11-20 07:42:30,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155922794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:30,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:42:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436844757] [2024-11-20 07:42:30,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:30,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:42:30,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:42:30,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:42:30,337 INFO L87 Difference]: Start difference. First operand has 50 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 07:42:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:30,360 INFO L93 Difference]: Finished difference Result 91 states and 144 transitions. [2024-11-20 07:42:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:42:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2024-11-20 07:42:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:30,368 INFO L225 Difference]: With dead ends: 91 [2024-11-20 07:42:30,368 INFO L226 Difference]: Without dead ends: 44 [2024-11-20 07:42:30,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:42:30,374 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:30,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:42:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-20 07:42:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-20 07:42:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 07:42:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2024-11-20 07:42:30,406 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 64 [2024-11-20 07:42:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:30,406 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2024-11-20 07:42:30,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 07:42:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2024-11-20 07:42:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-20 07:42:30,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:30,410 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:30,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:42:30,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:30,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:30,411 INFO L85 PathProgramCache]: Analyzing trace with hash 912199136, now seen corresponding path program 1 times [2024-11-20 07:42:30,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:30,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006578100] [2024-11-20 07:42:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:42:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:42:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:42:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:42:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006578100] [2024-11-20 07:42:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006578100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:42:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988605852] [2024-11-20 07:42:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:30,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:42:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:30,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:42:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:42:30,758 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:30,908 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-11-20 07:42:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 07:42:30,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 64 [2024-11-20 07:42:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:30,913 INFO L225 Difference]: With dead ends: 140 [2024-11-20 07:42:30,914 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 07:42:30,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:42:30,916 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:30,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 151 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:42:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 07:42:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2024-11-20 07:42:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:42:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2024-11-20 07:42:30,937 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 64 [2024-11-20 07:42:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:30,938 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-11-20 07:42:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2024-11-20 07:42:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 07:42:30,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:30,940 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:30,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:42:30,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:30,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1827602144, now seen corresponding path program 1 times [2024-11-20 07:42:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:30,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144050713] [2024-11-20 07:42:30,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:42:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:42:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:42:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:42:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144050713] [2024-11-20 07:42:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144050713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:31,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:42:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246101952] [2024-11-20 07:42:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:42:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:31,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:42:31,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:42:31,176 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:31,346 INFO L93 Difference]: Finished difference Result 185 states and 244 transitions. [2024-11-20 07:42:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:42:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-11-20 07:42:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:31,349 INFO L225 Difference]: With dead ends: 185 [2024-11-20 07:42:31,352 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 07:42:31,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:42:31,354 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 77 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:31,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 227 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:42:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 07:42:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2024-11-20 07:42:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 70 states have internal predecessors, (86), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:42:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2024-11-20 07:42:31,368 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 68 [2024-11-20 07:42:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:31,369 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2024-11-20 07:42:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2024-11-20 07:42:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 07:42:31,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:31,371 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:31,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:42:31,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1456247902, now seen corresponding path program 1 times [2024-11-20 07:42:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705471805] [2024-11-20 07:42:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:42:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:42:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:42:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:42:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:32,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705471805] [2024-11-20 07:42:32,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705471805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:32,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:32,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 07:42:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152565357] [2024-11-20 07:42:32,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:32,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:42:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:42:32,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:42:32,359 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:32,572 INFO L93 Difference]: Finished difference Result 229 states and 300 transitions. [2024-11-20 07:42:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:42:32,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-11-20 07:42:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:32,576 INFO L225 Difference]: With dead ends: 229 [2024-11-20 07:42:32,576 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 07:42:32,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:42:32,580 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:32,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 259 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:42:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 07:42:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2024-11-20 07:42:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.2) internal successors, (114), 95 states have internal predecessors, (114), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 07:42:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2024-11-20 07:42:32,607 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 68 [2024-11-20 07:42:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:32,609 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2024-11-20 07:42:32,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2024-11-20 07:42:32,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 07:42:32,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:32,613 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:32,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:42:32,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:32,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2136306272, now seen corresponding path program 1 times [2024-11-20 07:42:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820284055] [2024-11-20 07:42:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:42:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:42:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:42:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:42:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:34,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820284055] [2024-11-20 07:42:34,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820284055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:34,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:34,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 07:42:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470934749] [2024-11-20 07:42:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 07:42:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 07:42:34,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-20 07:42:34,703 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:35,811 INFO L93 Difference]: Finished difference Result 153 states and 192 transitions. [2024-11-20 07:42:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 07:42:35,811 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-11-20 07:42:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:35,813 INFO L225 Difference]: With dead ends: 153 [2024-11-20 07:42:35,813 INFO L226 Difference]: Without dead ends: 151 [2024-11-20 07:42:35,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2024-11-20 07:42:35,815 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 132 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:35,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 276 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:42:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-20 07:42:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2024-11-20 07:42:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 109 states have internal predecessors, (128), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 07:42:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2024-11-20 07:42:35,829 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 68 [2024-11-20 07:42:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:35,830 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2024-11-20 07:42:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2024-11-20 07:42:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-20 07:42:35,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:35,833 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:35,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 07:42:35,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:35,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 749449845, now seen corresponding path program 1 times [2024-11-20 07:42:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836930231] [2024-11-20 07:42:35,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:42:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:42:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:42:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:42:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:42:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:42:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:42:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:42:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:42:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:42:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:42:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-20 07:42:36,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836930231] [2024-11-20 07:42:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836930231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:36,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:42:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783404081] [2024-11-20 07:42:36,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:36,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:42:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:42:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:42:36,118 INFO L87 Difference]: Start difference. First operand 137 states and 176 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 07:42:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:36,151 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2024-11-20 07:42:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 07:42:36,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-20 07:42:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:36,153 INFO L225 Difference]: With dead ends: 147 [2024-11-20 07:42:36,153 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 07:42:36,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:42:36,155 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:36,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:42:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 07:42:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-11-20 07:42:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 63 states have internal predecessors, (69), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:42:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2024-11-20 07:42:36,165 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 131 [2024-11-20 07:42:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:36,166 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-11-20 07:42:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 07:42:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-11-20 07:42:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-20 07:42:36,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:36,167 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:36,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 07:42:36,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:36,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1557815806, now seen corresponding path program 1 times [2024-11-20 07:42:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094970383] [2024-11-20 07:42:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:42:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:42:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:42:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:42:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:42:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:42:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:42:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:42:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:42:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:42:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:42:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:42:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:42:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 07:42:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 07:42:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 07:42:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-20 07:42:36,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:42:36,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094970383] [2024-11-20 07:42:36,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094970383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:42:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060373903] [2024-11-20 07:42:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:36,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:42:36,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:42:36,440 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) [2024-11-20 07:42:36,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 07:42:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:36,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 07:42:36,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:42:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 331 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-20 07:42:41,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:42:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 50 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-20 07:42:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060373903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:42:44,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:42:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-11-20 07:42:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415561937] [2024-11-20 07:42:44,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:42:44,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 07:42:44,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:42:44,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 07:42:44,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-20 07:42:44,347 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-20 07:42:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:44,521 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2024-11-20 07:42:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 07:42:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 133 [2024-11-20 07:42:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:44,523 INFO L225 Difference]: With dead ends: 153 [2024-11-20 07:42:44,523 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 07:42:44,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-20 07:42:44,524 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:44,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 202 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:42:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 07:42:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-20 07:42:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 states have internal predecessors, (79), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:42:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2024-11-20 07:42:44,539 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 133 [2024-11-20 07:42:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:44,540 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2024-11-20 07:42:44,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-20 07:42:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2024-11-20 07:42:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 07:42:44,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:44,542 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:44,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 07:42:44,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:42:44,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:44,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 853881226, now seen corresponding path program 1 times [2024-11-20 07:42:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:42:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254281710] [2024-11-20 07:42:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:42:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:42:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982476453] [2024-11-20 07:42:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:44,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:42:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:42:44,817 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) [2024-11-20 07:42:44,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 07:42:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:42:45,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:42:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:42:45,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:42:45,205 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:42:45,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:42:45,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 07:42:45,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-20 07:42:45,412 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:45,492 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:42:45,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:42:45 BoogieIcfgContainer [2024-11-20 07:42:45,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:42:45,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:42:45,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:42:45,497 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:42:45,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:42:29" (3/4) ... [2024-11-20 07:42:45,501 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:42:45,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:42:45,503 INFO L158 Benchmark]: Toolchain (without parser) took 16445.81ms. Allocated memory was 184.5MB in the beginning and 673.2MB in the end (delta: 488.6MB). Free memory was 127.0MB in the beginning and 424.7MB in the end (delta: -297.6MB). Peak memory consumption was 192.3MB. Max. memory is 16.1GB. [2024-11-20 07:42:45,503 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:42:45,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.07ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 111.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:42:45,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.43ms. Allocated memory is still 184.5MB. Free memory was 111.9MB in the beginning and 109.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:42:45,507 INFO L158 Benchmark]: Boogie Preprocessor took 61.07ms. Allocated memory is still 184.5MB. Free memory was 109.5MB in the beginning and 106.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:42:45,507 INFO L158 Benchmark]: RCFGBuilder took 366.46ms. Allocated memory is still 184.5MB. Free memory was 106.5MB in the beginning and 90.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 07:42:45,507 INFO L158 Benchmark]: TraceAbstraction took 15612.53ms. Allocated memory was 184.5MB in the beginning and 673.2MB in the end (delta: 488.6MB). Free memory was 89.3MB in the beginning and 424.7MB in the end (delta: -335.3MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2024-11-20 07:42:45,507 INFO L158 Benchmark]: Witness Printer took 5.37ms. Allocated memory is still 673.2MB. Free memory is still 424.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:42:45,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.07ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 111.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.43ms. Allocated memory is still 184.5MB. Free memory was 111.9MB in the beginning and 109.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.07ms. Allocated memory is still 184.5MB. Free memory was 109.5MB in the beginning and 106.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 366.46ms. Allocated memory is still 184.5MB. Free memory was 106.5MB in the beginning and 90.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15612.53ms. Allocated memory was 184.5MB in the beginning and 673.2MB in the end (delta: 488.6MB). Free memory was 89.3MB in the beginning and 424.7MB in the end (delta: -335.3MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. * Witness Printer took 5.37ms. Allocated memory is still 673.2MB. Free memory is still 424.7MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] unsigned char var_1_7 = 200; [L24] unsigned char var_1_8 = 4; [L25] signed char var_1_9 = 50; [L26] signed char var_1_12 = -5; [L27] float var_1_13 = 999999999999.8; [L28] float var_1_14 = 100.5; [L29] float var_1_15 = 32.75; [L30] unsigned char var_1_16 = 1; [L31] unsigned char var_1_17 = 1; [L32] unsigned char var_1_18 = 128; [L33] unsigned char last_1_var_1_7 = 200; [L34] signed char last_1_var_1_9 = 50; VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=4, var_1_9=50] [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=4, var_1_9=50] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-220, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-272, var_1_7=200, var_1_8=-220, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 [L46] signed short int stepLocal_2 = var_1_1; [L47] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=200, var_1_8=-220, var_1_9=50] [L48] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=200, var_1_8=-220, var_1_9=50] [L49] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=200, var_1_8=-220, var_1_9=50] [L55] COND TRUE var_1_18 == var_1_18 [L56] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=-220, var_1_9=50] [L58] signed short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, stepLocal_3=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=-220, var_1_9=50] [L59] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=-220, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=-220, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND FALSE !(!(cond)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=-220, var_1_9=50] [L93] RET __VERIFIER_assert(property()) [L94] isInitial = 0 VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=-220, var_1_9=50] [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=-220, var_1_9=50] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=-272, var_1_7=-220, var_1_8=56, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-220, var_1_1=56, var_1_7=-220, var_1_8=56, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 [L46] signed short int stepLocal_2 = var_1_1; [L47] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=56, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=-220, var_1_8=56, var_1_9=50] [L48] COND TRUE \read(var_1_16) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=56, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=-220, var_1_8=56, var_1_9=50] [L49] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, stepLocal_2=56, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=-220, var_1_8=56, var_1_9=50] [L55] COND TRUE var_1_18 == var_1_18 [L56] var_1_7 = var_1_8 VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, stepLocal_2=56, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=56, var_1_8=56, var_1_9=50] [L58] signed short int stepLocal_3 = var_1_1; VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, stepLocal_2=56, stepLocal_3=56, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=56, var_1_8=56, var_1_9=50] [L59] COND TRUE var_1_18 == stepLocal_3 [L60] var_1_13 = (var_1_14 - var_1_15) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, stepLocal_2=56, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=56, var_1_8=56, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=56, var_1_8=56, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=56, var_1_8=56, var_1_9=50] [L19] reach_error() VAL [isInitial=0, last_1_var_1_7=-220, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=56, var_1_1=56, var_1_7=56, var_1_8=56, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 397 mSDsluCounter, 1298 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 951 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 347 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=5, InterpolantAutomatonStates: 51, 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, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 999 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 853 ConstructedInterpolants, 0 QuantifiedInterpolants, 3822 SizeOfPredicates, 15 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2571/2604 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 07:42:45,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:42:47,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:42:47,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:42:47,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:42:47,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:42:47,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:42:47,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:42:47,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:42:47,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:42:47,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:42:47,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:42:47,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:42:47,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:42:47,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:42:47,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:42:47,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:42:47,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:42:47,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:42:47,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:42:47,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:42:47,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:42:47,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:42:47,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:42:47,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:42:47,912 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:42:47,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:42:47,912 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:42:47,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:42:47,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:42:47,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:42:47,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:42:47,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:42:47,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:42:47,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:42:47,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:42:47,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:42:47,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:42:47,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:42:47,916 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:42:47,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:42:47,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:42:47,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:42:47,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:42:47,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:42:47,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 [2024-11-20 07:42:48,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:42:48,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:42:48,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:42:48,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:42:48,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:42:48,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-11-20 07:42:49,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:42:50,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:42:50,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-11-20 07:42:50,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92f0e67e/441c2e16efc340a7adc98cbec048a504/FLAGf6513e9cf [2024-11-20 07:42:50,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92f0e67e/441c2e16efc340a7adc98cbec048a504 [2024-11-20 07:42:50,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:42:50,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:42:50,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:42:50,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:42:50,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:42:50,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1a249b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50, skipping insertion in model container [2024-11-20 07:42:50,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:42:50,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-11-20 07:42:50,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:42:50,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:42:50,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-11-20 07:42:50,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:42:50,434 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:42:50,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50 WrapperNode [2024-11-20 07:42:50,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:42:50,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:42:50,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:42:50,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:42:50,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,487 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-20 07:42:50,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:42:50,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:42:50,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:42:50,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:42:50,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,520 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:42:50,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:42:50,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:42:50,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:42:50,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:42:50,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (1/1) ... [2024-11-20 07:42:50,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:42:50,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:42:50,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:42:50,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:42:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:42:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:42:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:42:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:42:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:42:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:42:50,725 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:42:50,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:42:51,108 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 07:42:51,109 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:42:51,125 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:42:51,126 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:42:51,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:42:51 BoogieIcfgContainer [2024-11-20 07:42:51,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:42:51,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:42:51,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:42:51,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:42:51,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:42:50" (1/3) ... [2024-11-20 07:42:51,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66315819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:42:51, skipping insertion in model container [2024-11-20 07:42:51,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:50" (2/3) ... [2024-11-20 07:42:51,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66315819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:42:51, skipping insertion in model container [2024-11-20 07:42:51,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:42:51" (3/3) ... [2024-11-20 07:42:51,137 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-33.i [2024-11-20 07:42:51,154 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:42:51,154 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:42:51,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:42:51,227 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4dc6187, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:42:51,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:42:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 07:42:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 07:42:51,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:51,241 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:51,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:51,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1891658366, now seen corresponding path program 1 times [2024-11-20 07:42:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:42:51,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839096001] [2024-11-20 07:42:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:51,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:42:51,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:42:51,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 07:42:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:51,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:42:51,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:42:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-20 07:42:51,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:42:51,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:42:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839096001] [2024-11-20 07:42:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839096001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:51,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:42:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547783620] [2024-11-20 07:42:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:42:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:42:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:42:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:42:51,535 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 07:42:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:51,559 INFO L93 Difference]: Finished difference Result 73 states and 114 transitions. [2024-11-20 07:42:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:42:51,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-11-20 07:42:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:51,568 INFO L225 Difference]: With dead ends: 73 [2024-11-20 07:42:51,569 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 07:42:51,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:42:51,588 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:51,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:42:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 07:42:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 07:42:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 07:42:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-20 07:42:51,631 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 60 [2024-11-20 07:42:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:51,631 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-20 07:42:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 07:42:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-20 07:42:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 07:42:51,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:51,636 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:51,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 07:42:51,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:51,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:51,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash -458830138, now seen corresponding path program 1 times [2024-11-20 07:42:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:42:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718623488] [2024-11-20 07:42:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:42:51,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:42:51,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 07:42:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:51,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 07:42:51,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:42:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:42:52,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:42:52,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:42:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718623488] [2024-11-20 07:42:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718623488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:42:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974055906] [2024-11-20 07:42:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:52,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:42:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:42:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:42:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:42:52,179 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:52,446 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2024-11-20 07:42:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 07:42:52,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2024-11-20 07:42:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:52,452 INFO L225 Difference]: With dead ends: 112 [2024-11-20 07:42:52,452 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 07:42:52,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:42:52,454 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 58 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:52,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:42:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 07:42:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2024-11-20 07:42:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:42:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2024-11-20 07:42:52,486 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 60 [2024-11-20 07:42:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:52,487 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2024-11-20 07:42:52,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2024-11-20 07:42:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 07:42:52,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:52,489 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:52,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 07:42:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:52,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:52,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -851857148, now seen corresponding path program 1 times [2024-11-20 07:42:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:42:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935954718] [2024-11-20 07:42:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:52,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:42:52,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:42:52,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 07:42:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:52,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 07:42:52,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:42:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-20 07:42:52,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:42:52,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:42:52,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935954718] [2024-11-20 07:42:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935954718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:52,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:52,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 07:42:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968047710] [2024-11-20 07:42:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 07:42:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:42:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 07:42:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:42:52,939 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 07:42:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:53,358 INFO L93 Difference]: Finished difference Result 151 states and 195 transitions. [2024-11-20 07:42:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 07:42:53,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-11-20 07:42:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:53,364 INFO L225 Difference]: With dead ends: 151 [2024-11-20 07:42:53,364 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 07:42:53,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-20 07:42:53,366 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 89 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:53,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 127 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:42:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 07:42:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-20 07:42:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:42:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2024-11-20 07:42:53,393 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 60 [2024-11-20 07:42:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:53,394 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2024-11-20 07:42:53,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 07:42:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2024-11-20 07:42:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 07:42:53,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:53,400 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:53,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 07:42:53,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:53,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 237329020, now seen corresponding path program 1 times [2024-11-20 07:42:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:42:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869897690] [2024-11-20 07:42:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:42:53,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:42:53,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 07:42:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:53,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 07:42:53,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:42:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:42:53,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:42:53,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:42:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869897690] [2024-11-20 07:42:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869897690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:42:53,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:42:53,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:42:53,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146593141] [2024-11-20 07:42:53,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:42:53,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:42:53,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:42:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:42:53,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:42:53,920 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:42:54,355 INFO L93 Difference]: Finished difference Result 267 states and 324 transitions. [2024-11-20 07:42:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:42:54,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2024-11-20 07:42:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:42:54,360 INFO L225 Difference]: With dead ends: 267 [2024-11-20 07:42:54,360 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 07:42:54,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:42:54,365 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:42:54,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 247 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 07:42:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 07:42:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2024-11-20 07:42:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 87 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 07:42:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2024-11-20 07:42:54,399 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 61 [2024-11-20 07:42:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:42:54,399 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2024-11-20 07:42:54,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:42:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2024-11-20 07:42:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 07:42:54,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:42:54,401 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:42:54,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 07:42:54,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:54,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:42:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:42:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash 239176062, now seen corresponding path program 1 times [2024-11-20 07:42:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:42:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769583252] [2024-11-20 07:42:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:42:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:42:54,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:42:54,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:42:54,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 07:42:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:42:54,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 07:42:54,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:43:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:43:09,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:43:09,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:43:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769583252] [2024-11-20 07:43:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769583252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:43:09,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:43:09,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:43:09,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011726048] [2024-11-20 07:43:09,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:43:09,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 07:43:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:43:09,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 07:43:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:43:09,711 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:43:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:43:10,054 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2024-11-20 07:43:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:43:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2024-11-20 07:43:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:43:10,057 INFO L225 Difference]: With dead ends: 128 [2024-11-20 07:43:10,057 INFO L226 Difference]: Without dead ends: 126 [2024-11-20 07:43:10,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-20 07:43:10,058 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:43:10,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 190 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:43:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-20 07:43:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-20 07:43:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 90 states have internal predecessors, (101), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 07:43:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2024-11-20 07:43:10,094 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 61 [2024-11-20 07:43:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:43:10,094 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2024-11-20 07:43:10,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:43:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2024-11-20 07:43:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 07:43:10,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:43:10,096 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:43:10,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 07:43:10,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:43:10,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:43:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:43:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1560266929, now seen corresponding path program 1 times [2024-11-20 07:43:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:43:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200049946] [2024-11-20 07:43:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:43:10,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:43:10,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:43:10,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:43:10,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 07:43:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:43:10,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 07:43:10,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:43:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-20 07:43:10,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:43:10,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:43:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200049946] [2024-11-20 07:43:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200049946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:43:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:43:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:43:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209128432] [2024-11-20 07:43:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:43:10,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:43:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:43:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:43:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:43:10,406 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:43:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:43:10,486 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2024-11-20 07:43:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:43:10,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 62 [2024-11-20 07:43:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:43:10,489 INFO L225 Difference]: With dead ends: 134 [2024-11-20 07:43:10,490 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 07:43:10,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:43:10,491 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:43:10,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:43:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 07:43:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-11-20 07:43:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:43:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-20 07:43:10,505 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 62 [2024-11-20 07:43:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:43:10,506 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-20 07:43:10,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-20 07:43:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-20 07:43:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 07:43:10,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:43:10,508 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:43:10,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 07:43:10,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:43:10,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:43:10,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:43:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1133709702, now seen corresponding path program 1 times [2024-11-20 07:43:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:43:10,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178253567] [2024-11-20 07:43:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:43:10,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:43:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:43:10,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:43:10,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 07:43:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:43:10,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 07:43:10,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:43:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 346 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-20 07:43:32,255 INFO L311 TraceCheckSpWp]: Computing backward predicates...