./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_fillercode_fillercodestructure_filler-ps-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercode_fillercodestructure_filler-ps-ci_file-27.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 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:07:54,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:07:54,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:07:54,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:07:54,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:07:54,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:07:54,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:07:54,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:07:54,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:07:54,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:07:54,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:07:54,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:07:54,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:07:54,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:07:54,351 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:07:54,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:07:54,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:07:54,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:07:54,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:07:54,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:07:54,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:07:54,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:07:54,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:07:54,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:07:54,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:07:54,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:07:54,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:07:54,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:07:54,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:07:54,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:07:54,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:07:54,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:07:54,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:07:54,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:07:54,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:07:54,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:07:54,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:07:54,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:07:54,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:07:54,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:07:54,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:07:54,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:07:54,363 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 -> 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 [2024-10-14 10:07:54,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:07:54,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:07:54,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:07:54,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:07:54,643 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:07:54,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2024-10-14 10:07:56,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:07:56,318 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:07:56,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2024-10-14 10:07:56,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de099de1/769e68dea5414555bcc45fc678f07026/FLAGa155a3536 [2024-10-14 10:07:56,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de099de1/769e68dea5414555bcc45fc678f07026 [2024-10-14 10:07:56,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:07:56,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:07:56,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:07:56,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:07:56,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:07:56,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57dc889a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56, skipping insertion in model container [2024-10-14 10:07:56,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:07:56,541 WARN L248 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2024-10-14 10:07:56,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:07:56,620 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:07:56,631 WARN L248 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2024-10-14 10:07:56,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:07:56,702 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:07:56,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56 WrapperNode [2024-10-14 10:07:56,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:07:56,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:07:56,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:07:56,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:07:56,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,799 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-10-14 10:07:56,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:07:56,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:07:56,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:07:56,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:07:56,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,847 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-10-14 10:07:56,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:07:56,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:07:56,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:07:56,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:07:56,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (1/1) ... [2024-10-14 10:07:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:07:56,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:07:56,921 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-10-14 10:07:56,925 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-10-14 10:07:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:07:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:07:56,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:07:56,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:07:56,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:07:56,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:07:57,063 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:07:57,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:07:57,497 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:07:57,498 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:07:57,586 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:07:57,587 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:07:57,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:57 BoogieIcfgContainer [2024-10-14 10:07:57,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:07:57,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:07:57,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:07:57,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:07:57,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:56" (1/3) ... [2024-10-14 10:07:57,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c289906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:57, skipping insertion in model container [2024-10-14 10:07:57,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:56" (2/3) ... [2024-10-14 10:07:57,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c289906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:57, skipping insertion in model container [2024-10-14 10:07:57,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:57" (3/3) ... [2024-10-14 10:07:57,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2024-10-14 10:07:57,619 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:07:57,619 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:07:57,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:07:57,703 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;@24ecd0bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:07:57,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:07:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 10:07:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 10:07:57,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:57,730 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 1] [2024-10-14 10:07:57,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 395065066, now seen corresponding path program 1 times [2024-10-14 10:07:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:57,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854622179] [2024-10-14 10:07:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:07:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:07:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:07:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:07:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:07:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 10:07:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:07:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:07:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:07:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 10:07:58,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:58,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854622179] [2024-10-14 10:07:58,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854622179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:58,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:58,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:07:58,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502861134] [2024-10-14 10:07:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:58,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:07:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:58,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:07:58,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:07:58,308 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 10:07:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:58,361 INFO L93 Difference]: Finished difference Result 165 states and 294 transitions. [2024-10-14 10:07:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:07:58,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2024-10-14 10:07:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:58,373 INFO L225 Difference]: With dead ends: 165 [2024-10-14 10:07:58,374 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 10:07:58,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-14 10:07:58,382 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:58,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:07:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 10:07:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 10:07:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 10:07:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2024-10-14 10:07:58,434 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 167 [2024-10-14 10:07:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:58,434 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2024-10-14 10:07:58,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 10:07:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2024-10-14 10:07:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 10:07:58,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:58,441 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 1] [2024-10-14 10:07:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:07:58,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1580277386, now seen corresponding path program 1 times [2024-10-14 10:07:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903095965] [2024-10-14 10:07:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:07:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:07:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:07:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:07:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:07:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 10:07:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:07:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:07:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:07:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 10:07:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903095965] [2024-10-14 10:07:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903095965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:59,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:59,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:07:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666949367] [2024-10-14 10:07:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:07:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:59,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:07:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:07:59,034 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:07:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:59,149 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2024-10-14 10:07:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:07:59,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-10-14 10:07:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:59,156 INFO L225 Difference]: With dead ends: 244 [2024-10-14 10:07:59,160 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 10:07:59,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-10-14 10:07:59,163 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:59,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 384 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:07:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 10:07:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2024-10-14 10:07:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 10:07:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2024-10-14 10:07:59,214 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 167 [2024-10-14 10:07:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:59,215 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2024-10-14 10:07:59,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:07:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2024-10-14 10:07:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 10:07:59,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:59,219 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 1, 1] [2024-10-14 10:07:59,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:07:59,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:59,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1547278470, now seen corresponding path program 1 times [2024-10-14 10:07:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352552758] [2024-10-14 10:07:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:07:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:07:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:07:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:07:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:07:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 10:07:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:07:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:07:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:07:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 10:07:59,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352552758] [2024-10-14 10:07:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352552758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:07:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14334327] [2024-10-14 10:07:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:59,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:07:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:59,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:07:59,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:07:59,732 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:08:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:00,281 INFO L93 Difference]: Finished difference Result 657 states and 1010 transitions. [2024-10-14 10:08:00,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:08:00,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-14 10:08:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:00,289 INFO L225 Difference]: With dead ends: 657 [2024-10-14 10:08:00,289 INFO L226 Difference]: Without dead ends: 499 [2024-10-14 10:08:00,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:08:00,292 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 247 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:00,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 481 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:08:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-14 10:08:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 489. [2024-10-14 10:08:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 344 states have (on average 1.3837209302325582) internal successors, (476), 348 states have internal predecessors, (476), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-14 10:08:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 748 transitions. [2024-10-14 10:08:00,387 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 748 transitions. Word has length 168 [2024-10-14 10:08:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:00,388 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 748 transitions. [2024-10-14 10:08:00,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:08:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 748 transitions. [2024-10-14 10:08:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 10:08:00,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:00,391 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 1, 1, 1] [2024-10-14 10:08:00,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:08:00,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:00,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:00,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1732407626, now seen corresponding path program 1 times [2024-10-14 10:08:00,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278085120] [2024-10-14 10:08:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:08:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:08:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:08:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 10:08:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:08:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:08:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:08:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:08:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:08:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:08:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:08:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:08:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:08:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:08:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:08:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:08:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:08:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:08:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:08:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:08:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:08:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 10:08:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278085120] [2024-10-14 10:08:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278085120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:08:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882534062] [2024-10-14 10:08:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:08:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:08:00,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:00,692 INFO L87 Difference]: Start difference. First operand 489 states and 748 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:08:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:00,809 INFO L93 Difference]: Finished difference Result 1015 states and 1557 transitions. [2024-10-14 10:08:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:08:00,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-14 10:08:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:00,818 INFO L225 Difference]: With dead ends: 1015 [2024-10-14 10:08:00,818 INFO L226 Difference]: Without dead ends: 527 [2024-10-14 10:08:00,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-10-14 10:08:00,822 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:00,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 214 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:08:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-14 10:08:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 489. [2024-10-14 10:08:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 344 states have (on average 1.3662790697674418) internal successors, (470), 348 states have internal predecessors, (470), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-14 10:08:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 742 transitions. [2024-10-14 10:08:00,871 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 742 transitions. Word has length 169 [2024-10-14 10:08:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:00,872 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 742 transitions. [2024-10-14 10:08:00,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:08:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 742 transitions. [2024-10-14 10:08:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 10:08:00,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:00,874 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 1, 1, 1] [2024-10-14 10:08:00,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:08:00,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -43463884, now seen corresponding path program 1 times [2024-10-14 10:08:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587542326] [2024-10-14 10:08:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:08:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:08:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:08:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 10:08:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:08:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:08:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:08:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:08:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:08:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:08:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:08:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:08:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:08:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:08:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:08:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:08:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:08:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:08:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:08:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:08:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:08:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 90 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2024-10-14 10:08:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587542326] [2024-10-14 10:08:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587542326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816316073] [2024-10-14 10:08:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:01,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:01,841 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-10-14 10:08:01,843 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-10-14 10:08:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 10:08:01,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-10-14 10:08:02,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:08:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-10-14 10:08:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816316073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:08:03,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:08:03,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 21 [2024-10-14 10:08:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071704792] [2024-10-14 10:08:03,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:08:03,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 10:08:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 10:08:03,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-10-14 10:08:03,709 INFO L87 Difference]: Start difference. First operand 489 states and 742 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 21 states have internal predecessors, (75), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-14 10:08:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:05,191 INFO L93 Difference]: Finished difference Result 1365 states and 2003 transitions. [2024-10-14 10:08:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-14 10:08:05,192 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 21 states have internal predecessors, (75), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 169 [2024-10-14 10:08:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:05,198 INFO L225 Difference]: With dead ends: 1365 [2024-10-14 10:08:05,198 INFO L226 Difference]: Without dead ends: 877 [2024-10-14 10:08:05,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 379 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=613, Invalid=1643, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 10:08:05,203 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 373 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:05,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 663 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 10:08:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-14 10:08:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 694. [2024-10-14 10:08:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 486 states have (on average 1.3065843621399178) internal successors, (635), 492 states have internal predecessors, (635), 182 states have call successors, (182), 25 states have call predecessors, (182), 25 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2024-10-14 10:08:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 999 transitions. [2024-10-14 10:08:05,358 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 999 transitions. Word has length 169 [2024-10-14 10:08:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 999 transitions. [2024-10-14 10:08:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 21 states have internal predecessors, (75), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-14 10:08:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 999 transitions. [2024-10-14 10:08:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 10:08:05,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:05,363 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 1, 1, 1] [2024-10-14 10:08:05,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 10:08:05,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:05,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:05,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2021843925, now seen corresponding path program 1 times [2024-10-14 10:08:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:05,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694258978] [2024-10-14 10:08:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:08:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047295088] [2024-10-14 10:08:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:05,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:05,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:05,678 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-10-14 10:08:05,679 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-10-14 10:08:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:06,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 10:08:06,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 757 proven. 123 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:08:06,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:08:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694258978] [2024-10-14 10:08:07,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 10:08:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047295088] [2024-10-14 10:08:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047295088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:07,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:08:07,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-14 10:08:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715651752] [2024-10-14 10:08:07,253 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 10:08:07,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 10:08:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:07,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 10:08:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=111, Unknown=1, NotChecked=0, Total=156 [2024-10-14 10:08:07,254 INFO L87 Difference]: Start difference. First operand 694 states and 999 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-14 10:08:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:07,992 INFO L93 Difference]: Finished difference Result 1432 states and 2019 transitions. [2024-10-14 10:08:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 10:08:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 169 [2024-10-14 10:08:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:07,999 INFO L225 Difference]: With dead ends: 1432 [2024-10-14 10:08:08,001 INFO L226 Difference]: Without dead ends: 759 [2024-10-14 10:08:08,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=310, Unknown=1, NotChecked=0, Total=462 [2024-10-14 10:08:08,004 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 192 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:08,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 445 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:08:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-10-14 10:08:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 720. [2024-10-14 10:08:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 504 states have (on average 1.2837301587301588) internal successors, (647), 510 states have internal predecessors, (647), 182 states have call successors, (182), 33 states have call predecessors, (182), 33 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2024-10-14 10:08:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1011 transitions. [2024-10-14 10:08:08,110 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1011 transitions. Word has length 169 [2024-10-14 10:08:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1011 transitions. [2024-10-14 10:08:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-14 10:08:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1011 transitions. [2024-10-14 10:08:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 10:08:08,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:08,114 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 1, 1, 1, 1] [2024-10-14 10:08:08,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 10:08:08,314 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,SelfDestructingSolverStorable5 [2024-10-14 10:08:08,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:08,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:08,315 INFO L85 PathProgramCache]: Analyzing trace with hash -156173733, now seen corresponding path program 1 times [2024-10-14 10:08:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:08,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622790767] [2024-10-14 10:08:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:08:08,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120315711] [2024-10-14 10:08:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:08,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:08:08,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 10:08:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:08:08,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:08:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:08:09,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:08:09,095 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:08:09,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:08:09,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 10:08:09,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:09,301 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:09,425 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:08:09,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:08:09 BoogieIcfgContainer [2024-10-14 10:08:09,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:08:09,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:08:09,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:08:09,429 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:08:09,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:57" (3/4) ... [2024-10-14 10:08:09,431 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:08:09,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:08:09,433 INFO L158 Benchmark]: Toolchain (without parser) took 13086.18ms. Allocated memory was 167.8MB in the beginning and 323.0MB in the end (delta: 155.2MB). Free memory was 119.9MB in the beginning and 248.9MB in the end (delta: -129.0MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-10-14 10:08:09,433 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 167.8MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:08:09,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.58ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 102.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 10:08:09,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.54ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 99.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:08:09,434 INFO L158 Benchmark]: Boogie Preprocessor took 82.30ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:08:09,434 INFO L158 Benchmark]: RCFGBuilder took 705.44ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 94.3MB in the beginning and 190.3MB in the end (delta: -96.0MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2024-10-14 10:08:09,435 INFO L158 Benchmark]: TraceAbstraction took 11836.11ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 189.2MB in the beginning and 248.9MB in the end (delta: -59.7MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-10-14 10:08:09,435 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 323.0MB. Free memory is still 248.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:08:09,436 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.69ms. Allocated memory is still 167.8MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.58ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 102.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.54ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 99.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.30ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 705.44ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 94.3MB in the beginning and 190.3MB in the end (delta: -96.0MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11836.11ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 189.2MB in the beginning and 248.9MB in the end (delta: -59.7MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 323.0MB. Free memory is still 248.9MB. 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 177, overapproximation of shiftRight at line 94, overapproximation of someBinaryArithmeticFLOAToperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] var_1_23 = var_1_12 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L56] COND FALSE !(var_1_11 < var_1_12) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L61] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L62] COND TRUE var_1_11 >= var_1_11 [L63] var_1_31 = ((((var_1_11) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_11) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L65] COND TRUE var_1_20 < (~ (var_1_11 / var_1_33)) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L66] COND TRUE \read(var_1_17) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L67] COND TRUE (var_1_13 * var_1_6) == var_1_5 [L68] var_1_32 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L80] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L85] COND TRUE ((((var_1_11) < (var_1_33)) ? (var_1_11) : (var_1_33))) < (var_1_39 + var_1_12) [L86] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=0, var_1_8=1] [L88] var_1_47 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L89] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L90] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L92] var_1_20 = var_1_11 [L93] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934624, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L94] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934624, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L94] COND FALSE !((var_1_21 + var_1_12) > (2u >> var_1_11)) [L101] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934624, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L112] unsigned char stepLocal_1 = var_1_14; [L113] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934624, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L114] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934624, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L115] COND TRUE stepLocal_1 || var_1_14 [L116] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934624, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=1] [L123] COND FALSE !(var_1_6 > (- var_1_7)) [L128] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934624, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=32] [L130] var_1_22 = var_1_8 [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934624, var_1_21=8, var_1_22=32, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=32] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934624, var_1_21=8, var_1_22=32, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=32] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=8589934624, var_1_12=8589934624, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934624, var_1_21=8, var_1_22=32, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934624, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=65535, var_1_3=1, var_1_43=8589934624, var_1_47=8589934624, var_1_8=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 932 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 890 mSDsluCounter, 2311 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1518 mSDsCounter, 260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1474 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 260 mSolverCounterUnsat, 793 mSDtfsCounter, 1474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 820 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=720occurred in iteration=6, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 274 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1687 NumberOfCodeBlocks, 1687 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 7006 SizeOfPredicates, 10 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 9998/10400 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-10-14 10:08:09,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fillercode_fillercodestructure_filler-ps-ci_file-27.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 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:08:11,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:08:11,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:08:11,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:08:11,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:08:11,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:08:11,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:08:11,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:08:11,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:08:11,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:08:11,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:08:11,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:08:11,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:08:11,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:08:11,831 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:08:11,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:08:11,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:08:11,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:08:11,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:08:11,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:08:11,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:08:11,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:08:11,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:08:11,837 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:08:11,837 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:08:11,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:08:11,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:08:11,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:08:11,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:08:11,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:08:11,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:08:11,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:08:11,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:08:11,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:08:11,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:11,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:08:11,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:08:11,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:08:11,840 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:08:11,842 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:08:11,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:08:11,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:08:11,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:08:11,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:08:11,843 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:08:11,844 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 -> 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 [2024-10-14 10:08:12,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:08:12,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:08:12,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:08:12,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:08:12,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:08:12,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2024-10-14 10:08:13,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:08:14,141 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:08:14,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2024-10-14 10:08:14,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a35472af/f81e8eaacb56402eb44afd59b2139a9e/FLAGe31833778 [2024-10-14 10:08:14,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a35472af/f81e8eaacb56402eb44afd59b2139a9e [2024-10-14 10:08:14,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:08:14,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:08:14,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:14,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:08:14,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:08:14,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:14,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4473d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14, skipping insertion in model container [2024-10-14 10:08:14,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:14,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:08:14,726 WARN L248 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2024-10-14 10:08:14,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:14,847 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:08:14,862 WARN L248 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2024-10-14 10:08:14,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:14,938 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:08:14,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14 WrapperNode [2024-10-14 10:08:14,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:14,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:14,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:08:14,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:08:14,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:14,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,009 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-14 10:08:15,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:15,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:08:15,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:08:15,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:08:15,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,064 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-10-14 10:08:15,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:08:15,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:08:15,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:08:15,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:08:15,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2024-10-14 10:08:15,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:15,165 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-10-14 10:08:15,168 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-10-14 10:08:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:08:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:08:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:08:15,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:08:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:08:15,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:08:15,330 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:08:15,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:08:21,948 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 10:08:21,949 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:08:22,001 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:08:22,001 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:08:22,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:22 BoogieIcfgContainer [2024-10-14 10:08:22,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:08:22,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:08:22,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:08:22,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:08:22,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:08:14" (1/3) ... [2024-10-14 10:08:22,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e2ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:22, skipping insertion in model container [2024-10-14 10:08:22,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (2/3) ... [2024-10-14 10:08:22,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e2ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:22, skipping insertion in model container [2024-10-14 10:08:22,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:22" (3/3) ... [2024-10-14 10:08:22,020 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2024-10-14 10:08:22,036 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:08:22,037 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:08:22,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:08:22,107 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;@2e5de0c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:08:22,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:08:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 10:08:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 10:08:22,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:22,130 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-10-14 10:08:22,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:22,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1072612878, now seen corresponding path program 1 times [2024-10-14 10:08:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:08:22,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467025876] [2024-10-14 10:08:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:22,147 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-10-14 10:08:22,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:08:22,151 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-10-14 10:08:22,152 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-10-14 10:08:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:22,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:08:22,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-14 10:08:22,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:08:22,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:08:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467025876] [2024-10-14 10:08:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467025876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:22,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:22,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:08:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314576392] [2024-10-14 10:08:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:08:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:08:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:08:22,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:08:22,675 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 10:08:24,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:08:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:24,810 INFO L93 Difference]: Finished difference Result 151 states and 274 transitions. [2024-10-14 10:08:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:08:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-10-14 10:08:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:24,852 INFO L225 Difference]: With dead ends: 151 [2024-10-14 10:08:24,852 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 10:08:24,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-10-14 10:08:24,860 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:24,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 10:08:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 10:08:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-14 10:08:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 10:08:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2024-10-14 10:08:24,936 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 164 [2024-10-14 10:08:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:24,936 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2024-10-14 10:08:24,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 10:08:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2024-10-14 10:08:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 10:08:24,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:24,942 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-10-14 10:08:24,962 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-10-14 10:08:25,143 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-10-14 10:08:25,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:25,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1823672066, now seen corresponding path program 1 times [2024-10-14 10:08:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:08:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747046774] [2024-10-14 10:08:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:25,146 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-10-14 10:08:25,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:08:25,149 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-10-14 10:08:25,150 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-10-14 10:08:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:25,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:08:25,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-14 10:08:26,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:08:27,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:08:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747046774] [2024-10-14 10:08:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747046774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [840260461] [2024-10-14 10:08:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:27,446 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:08:27,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:08:27,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:08:27,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-14 10:08:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:27,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-14 10:08:27,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-14 10:08:31,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:08:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 10:08:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [840260461] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:34,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:08:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 15 [2024-10-14 10:08:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911125273] [2024-10-14 10:08:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:34,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:08:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:08:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:08:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:08:34,861 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 10:08:39,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:08:43,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:08:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:43,989 INFO L93 Difference]: Finished difference Result 276 states and 430 transitions. [2024-10-14 10:08:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:08:43,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-10-14 10:08:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:43,996 INFO L225 Difference]: With dead ends: 276 [2024-10-14 10:08:43,997 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 10:08:43,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 490 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-14 10:08:43,999 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 184 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:43,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 352 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2024-10-14 10:08:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 10:08:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2024-10-14 10:08:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 120 states have internal predecessors, (161), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 10:08:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 301 transitions. [2024-10-14 10:08:44,047 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 301 transitions. Word has length 164 [2024-10-14 10:08:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:44,048 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 301 transitions. [2024-10-14 10:08:44,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 10:08:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 301 transitions. [2024-10-14 10:08:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 10:08:44,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:44,051 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-10-14 10:08:44,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-14 10:08:44,267 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 (3)] Forceful destruction successful, exit code 0 [2024-10-14 10:08:44,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,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-10-14 10:08:44,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:44,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash 451922910, now seen corresponding path program 1 times [2024-10-14 10:08:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:08:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744794607] [2024-10-14 10:08:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:44,454 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-10-14 10:08:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:08:44,458 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-10-14 10:08:44,459 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-10-14 10:08:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:44,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:08:44,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-14 10:08:45,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:08:45,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:08:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744794607] [2024-10-14 10:08:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744794607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:45,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1164212682] [2024-10-14 10:08:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:45,974 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:08:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:08:45,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:08:45,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-14 10:08:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-14 10:08:46,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 10:08:51,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:08:51,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1164212682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:51,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:08:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 10:08:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936709029] [2024-10-14 10:08:51,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:51,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:08:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:08:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:08:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 10:08:51,125 INFO L87 Difference]: Start difference. First operand 193 states and 301 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:08:58,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:09:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:01,796 INFO L93 Difference]: Finished difference Result 452 states and 704 transitions. [2024-10-14 10:09:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:09:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-14 10:09:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:01,822 INFO L225 Difference]: With dead ends: 452 [2024-10-14 10:09:01,822 INFO L226 Difference]: Without dead ends: 260 [2024-10-14 10:09:01,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:09:01,825 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:01,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 287 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-10-14 10:09:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-14 10:09:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2024-10-14 10:09:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 147 states have internal predecessors, (191), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 10:09:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 383 transitions. [2024-10-14 10:09:01,861 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 383 transitions. Word has length 165 [2024-10-14 10:09:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 383 transitions. [2024-10-14 10:09:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:09:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 383 transitions. [2024-10-14 10:09:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 10:09:01,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:01,865 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-10-14 10:09:01,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-14 10:09:02,080 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-10-14 10:09:02,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,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-10-14 10:09:02,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1731786588, now seen corresponding path program 1 times [2024-10-14 10:09:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:09:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8425432] [2024-10-14 10:09:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:02,268 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-10-14 10:09:02,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:09:02,270 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-10-14 10:09:02,271 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-10-14 10:09:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:02,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:09:02,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:09:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-14 10:09:03,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:09:04,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:09:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8425432] [2024-10-14 10:09:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8425432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:09:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [2123993367] [2024-10-14 10:09:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:04,013 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:09:04,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:09:04,016 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:09:04,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-14 10:09:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:04,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-14 10:09:04,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:09:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 10:09:08,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:09:08,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [2123993367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:08,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:09:08,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-14 10:09:08,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16361069] [2024-10-14 10:09:08,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:08,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:09:08,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:09:08,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:09:08,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:09:08,216 INFO L87 Difference]: Start difference. First operand 247 states and 383 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 10:09:14,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []