./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-pr-ci_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-pr-ci_file-75.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 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:31:50,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:31:50,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:31:50,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:31:50,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:31:50,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:31:50,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:31:50,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:31:50,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:31:50,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:31:50,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:31:50,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:31:50,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:31:50,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:31:50,812 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:31:50,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:31:50,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:31:50,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:31:50,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:31:50,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:31:50,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:31:50,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:31:50,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:31:50,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:31:50,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:31:50,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:31:50,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:31:50,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:31:50,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:31:50,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:31:50,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:31:50,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:31:50,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:31:50,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:31:50,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:31:50,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:31:50,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:31:50,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:31:50,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:31:50,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:31:50,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:31:50,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:31:50,821 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 -> 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 [2024-10-24 07:31:51,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:31:51,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:31:51,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:31:51,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:31:51,116 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:31:51,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-24 07:31:52,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:31:52,658 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:31:52,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-24 07:31:52,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ab95f3a/76a737a4cbb7423f993d18bb85a6cc6d/FLAG081a8257d [2024-10-24 07:31:52,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ab95f3a/76a737a4cbb7423f993d18bb85a6cc6d [2024-10-24 07:31:52,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:31:52,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:31:52,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:31:52,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:31:52,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:31:52,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:31:52" (1/1) ... [2024-10-24 07:31:52,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169fb76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:52, skipping insertion in model container [2024-10-24 07:31:52,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:31:52" (1/1) ... [2024-10-24 07:31:52,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:31:52,887 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-pr-ci_file-75.i[919,932] [2024-10-24 07:31:52,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:31:52,971 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:31:52,981 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-pr-ci_file-75.i[919,932] [2024-10-24 07:31:53,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:31:53,031 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:31:53,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53 WrapperNode [2024-10-24 07:31:53,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:31:53,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:31:53,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:31:53,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:31:53,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,097 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-24 07:31:53,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:31:53,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:31:53,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:31:53,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:31:53,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,147 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-24 07:31:53,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:31:53,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:31:53,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:31:53,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:31:53,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (1/1) ... [2024-10-24 07:31:53,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:31:53,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:31:53,250 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-24 07:31:53,273 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-24 07:31:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:31:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:31:53,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:31:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:31:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:31:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:31:53,385 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:31:53,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:31:53,762 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:31:53,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:31:53,811 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:31:53,812 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:31:53,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:31:53 BoogieIcfgContainer [2024-10-24 07:31:53,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:31:53,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:31:53,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:31:53,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:31:53,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:31:52" (1/3) ... [2024-10-24 07:31:53,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:31:53, skipping insertion in model container [2024-10-24 07:31:53,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:31:53" (2/3) ... [2024-10-24 07:31:53,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:31:53, skipping insertion in model container [2024-10-24 07:31:53,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:31:53" (3/3) ... [2024-10-24 07:31:53,824 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-24 07:31:53,839 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:31:53,840 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:31:53,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:31:53,911 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;@1517e105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:31:53,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:31:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 74 states have (on average 1.554054054054054) internal successors, (115), 75 states have internal predecessors, (115), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 07:31:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 07:31:53,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:53,934 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:53,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:53,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1581202767, now seen corresponding path program 1 times [2024-10-24 07:31:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589049921] [2024-10-24 07:31:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 07:31:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589049921] [2024-10-24 07:31:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589049921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:31:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:31:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:31:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505414746] [2024-10-24 07:31:54,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:31:54,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:31:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:54,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:31:54,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:31:54,454 INFO L87 Difference]: Start difference. First operand has 101 states, 74 states have (on average 1.554054054054054) internal successors, (115), 75 states have internal predecessors, (115), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 07:31:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:31:54,493 INFO L93 Difference]: Finished difference Result 198 states and 347 transitions. [2024-10-24 07:31:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:31:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-10-24 07:31:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:31:54,505 INFO L225 Difference]: With dead ends: 198 [2024-10-24 07:31:54,506 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 07:31:54,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-24 07:31:54,516 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:31:54,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:31:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 07:31:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-24 07:31:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 72 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 07:31:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2024-10-24 07:31:54,565 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 160 [2024-10-24 07:31:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:31:54,570 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2024-10-24 07:31:54,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 07:31:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-10-24 07:31:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:31:54,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:54,576 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:54,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:31:54,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:54,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 732342797, now seen corresponding path program 1 times [2024-10-24 07:31:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661252625] [2024-10-24 07:31:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 07:31:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661252625] [2024-10-24 07:31:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661252625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:31:54,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:31:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:31:54,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910196735] [2024-10-24 07:31:54,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:31:54,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:31:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:54,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:31:54,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:31:54,933 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:31:55,076 INFO L93 Difference]: Finished difference Result 282 states and 449 transitions. [2024-10-24 07:31:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:31:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-24 07:31:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:31:55,079 INFO L225 Difference]: With dead ends: 282 [2024-10-24 07:31:55,079 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 07:31:55,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-24 07:31:55,081 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 125 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:31:55,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 311 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:31:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 07:31:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2024-10-24 07:31:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 125 states have (on average 1.392) internal successors, (174), 125 states have internal predecessors, (174), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 07:31:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 270 transitions. [2024-10-24 07:31:55,111 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 270 transitions. Word has length 161 [2024-10-24 07:31:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:31:55,112 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 270 transitions. [2024-10-24 07:31:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 270 transitions. [2024-10-24 07:31:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 07:31:55,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:55,120 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:55,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:31:55,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1229871841, now seen corresponding path program 1 times [2024-10-24 07:31:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673782914] [2024-10-24 07:31:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 07:31:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:55,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673782914] [2024-10-24 07:31:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673782914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:31:55,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:31:55,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:31:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792833673] [2024-10-24 07:31:55,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:31:55,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:31:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:55,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:31:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:31:55,563 INFO L87 Difference]: Start difference. First operand 176 states and 270 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:31:55,661 INFO L93 Difference]: Finished difference Result 407 states and 628 transitions. [2024-10-24 07:31:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:31:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-24 07:31:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:31:55,663 INFO L225 Difference]: With dead ends: 407 [2024-10-24 07:31:55,664 INFO L226 Difference]: Without dead ends: 232 [2024-10-24 07:31:55,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-24 07:31:55,666 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 46 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:31:55,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 253 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:31:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-24 07:31:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2024-10-24 07:31:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 146 states have internal predecessors, (196), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 07:31:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 340 transitions. [2024-10-24 07:31:55,685 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 340 transitions. Word has length 162 [2024-10-24 07:31:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:31:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 340 transitions. [2024-10-24 07:31:55,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 340 transitions. [2024-10-24 07:31:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 07:31:55,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:55,687 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:55,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:31:55,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:55,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1161081676, now seen corresponding path program 1 times [2024-10-24 07:31:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291453784] [2024-10-24 07:31:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 07:31:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291453784] [2024-10-24 07:31:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291453784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:31:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:31:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:31:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085426902] [2024-10-24 07:31:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:31:55,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:31:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:31:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:31:55,986 INFO L87 Difference]: Start difference. First operand 222 states and 340 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:31:56,452 INFO L93 Difference]: Finished difference Result 577 states and 889 transitions. [2024-10-24 07:31:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 07:31:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-10-24 07:31:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:31:56,456 INFO L225 Difference]: With dead ends: 577 [2024-10-24 07:31:56,456 INFO L226 Difference]: Without dead ends: 402 [2024-10-24 07:31:56,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:31:56,461 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 377 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:31:56,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 547 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 07:31:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-24 07:31:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 378. [2024-10-24 07:31:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 260 states have (on average 1.353846153846154) internal successors, (352), 261 states have internal predecessors, (352), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-24 07:31:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 574 transitions. [2024-10-24 07:31:56,520 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 574 transitions. Word has length 163 [2024-10-24 07:31:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:31:56,520 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 574 transitions. [2024-10-24 07:31:56,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 574 transitions. [2024-10-24 07:31:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 07:31:56,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:56,522 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:56,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:31:56,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:56,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2086162910, now seen corresponding path program 1 times [2024-10-24 07:31:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:56,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983555024] [2024-10-24 07:31:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 07:31:56,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:56,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983555024] [2024-10-24 07:31:56,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983555024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:31:56,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:31:56,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:31:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091584369] [2024-10-24 07:31:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:31:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:31:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:31:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:31:56,681 INFO L87 Difference]: Start difference. First operand 378 states and 574 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:31:56,759 INFO L93 Difference]: Finished difference Result 694 states and 1055 transitions. [2024-10-24 07:31:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:31:56,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-10-24 07:31:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:31:56,764 INFO L225 Difference]: With dead ends: 694 [2024-10-24 07:31:56,764 INFO L226 Difference]: Without dead ends: 378 [2024-10-24 07:31:56,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-24 07:31:56,766 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:31:56,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:31:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-24 07:31:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2024-10-24 07:31:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 261 states have internal predecessors, (350), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-24 07:31:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 572 transitions. [2024-10-24 07:31:56,790 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 572 transitions. Word has length 163 [2024-10-24 07:31:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:31:56,790 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 572 transitions. [2024-10-24 07:31:56,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 572 transitions. [2024-10-24 07:31:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 07:31:56,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:56,792 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 07:31:56,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1393429382, now seen corresponding path program 1 times [2024-10-24 07:31:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426630838] [2024-10-24 07:31:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 07:31:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426630838] [2024-10-24 07:31:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426630838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:31:57,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:31:57,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 07:31:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146138261] [2024-10-24 07:31:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:31:57,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:31:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:31:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:31:57,137 INFO L87 Difference]: Start difference. First operand 378 states and 572 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 07:31:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:31:58,020 INFO L93 Difference]: Finished difference Result 711 states and 1080 transitions. [2024-10-24 07:31:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:31:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-24 07:31:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:31:58,024 INFO L225 Difference]: With dead ends: 711 [2024-10-24 07:31:58,024 INFO L226 Difference]: Without dead ends: 403 [2024-10-24 07:31:58,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-24 07:31:58,028 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 355 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:31:58,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 797 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:31:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-24 07:31:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2024-10-24 07:31:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 261 states have (on average 1.3409961685823755) internal successors, (350), 262 states have internal predecessors, (350), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-24 07:31:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 572 transitions. [2024-10-24 07:31:58,117 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 572 transitions. Word has length 164 [2024-10-24 07:31:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:31:58,118 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 572 transitions. [2024-10-24 07:31:58,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 07:31:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 572 transitions. [2024-10-24 07:31:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 07:31:58,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:58,120 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:58,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 07:31:58,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:58,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -47803458, now seen corresponding path program 1 times [2024-10-24 07:31:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278463058] [2024-10-24 07:31:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:58,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 07:31:58,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278463058] [2024-10-24 07:31:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278463058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:31:58,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:31:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:31:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503832589] [2024-10-24 07:31:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:31:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:31:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:58,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:31:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:31:58,272 INFO L87 Difference]: Start difference. First operand 379 states and 572 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:31:58,313 INFO L93 Difference]: Finished difference Result 631 states and 956 transitions. [2024-10-24 07:31:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:31:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-24 07:31:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:31:58,316 INFO L225 Difference]: With dead ends: 631 [2024-10-24 07:31:58,316 INFO L226 Difference]: Without dead ends: 379 [2024-10-24 07:31:58,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-24 07:31:58,318 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:31:58,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:31:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-24 07:31:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-10-24 07:31:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 261 states have (on average 1.3371647509578544) internal successors, (349), 262 states have internal predecessors, (349), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-24 07:31:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 571 transitions. [2024-10-24 07:31:58,354 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 571 transitions. Word has length 164 [2024-10-24 07:31:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:31:58,354 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 571 transitions. [2024-10-24 07:31:58,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 07:31:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 571 transitions. [2024-10-24 07:31:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 07:31:58,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:31:58,356 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:31:58,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 07:31:58,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:31:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:31:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash -350547014, now seen corresponding path program 1 times [2024-10-24 07:31:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:31:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873225257] [2024-10-24 07:31:58,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:58,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:31:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:31:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:31:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:31:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:31:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:31:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:31:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:31:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:31:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:31:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:31:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:31:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:31:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:31:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:31:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:31:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:31:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:31:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:31:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:31:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:31:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:31:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:31:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:31:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:31:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 07:31:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:31:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873225257] [2024-10-24 07:31:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873225257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:31:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742589564] [2024-10-24 07:31:58,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:31:58,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:31:58,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:31:58,651 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-24 07:31:58,658 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-24 07:31:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:31:58,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 07:31:58,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:31:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-24 07:31:59,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:31:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 07:31:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742589564] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:31:59,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:31:59,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2024-10-24 07:31:59,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924790336] [2024-10-24 07:31:59,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:31:59,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 07:31:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:31:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 07:31:59,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 07:31:59,544 INFO L87 Difference]: Start difference. First operand 379 states and 571 transitions. Second operand has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-24 07:32:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:32:00,568 INFO L93 Difference]: Finished difference Result 595 states and 886 transitions. [2024-10-24 07:32:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 07:32:00,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 165 [2024-10-24 07:32:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:32:00,571 INFO L225 Difference]: With dead ends: 595 [2024-10-24 07:32:00,571 INFO L226 Difference]: Without dead ends: 282 [2024-10-24 07:32:00,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2024-10-24 07:32:00,573 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 575 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:32:00,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 589 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:32:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-24 07:32:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 162. [2024-10-24 07:32:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 107 states have internal predecessors, (133), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 07:32:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 229 transitions. [2024-10-24 07:32:00,603 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 229 transitions. Word has length 165 [2024-10-24 07:32:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:32:00,604 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 229 transitions. [2024-10-24 07:32:00,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-24 07:32:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 229 transitions. [2024-10-24 07:32:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 07:32:00,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:32:00,605 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:32:00,622 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-24 07:32:00,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:32:00,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:32:00,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:32:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1112586807, now seen corresponding path program 1 times [2024-10-24 07:32:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:32:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794864359] [2024-10-24 07:32:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:32:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:32:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:32:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:32:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:32:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:32:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:32:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:32:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:32:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:32:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:32:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:32:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:32:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:32:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:32:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:32:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:32:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 07:32:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:32:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 07:32:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:32:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 07:32:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:32:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:32:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:32:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:32:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 07:32:01,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:32:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794864359] [2024-10-24 07:32:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794864359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:32:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688079613] [2024-10-24 07:32:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:32:01,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:32:01,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:32:01,419 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-24 07:32:01,423 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-24 07:32:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:01,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 07:32:01,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:32:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-24 07:32:01,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:32:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 07:32:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688079613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:32:02,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:32:02,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2024-10-24 07:32:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240796347] [2024-10-24 07:32:02,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:32:02,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 07:32:02,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:32:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 07:32:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-24 07:32:02,050 INFO L87 Difference]: Start difference. First operand 162 states and 229 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-24 07:32:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:32:02,920 INFO L93 Difference]: Finished difference Result 286 states and 404 transitions. [2024-10-24 07:32:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 07:32:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 166 [2024-10-24 07:32:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:32:02,922 INFO L225 Difference]: With dead ends: 286 [2024-10-24 07:32:02,923 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 07:32:02,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2024-10-24 07:32:02,924 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 257 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:32:02,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 762 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:32:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 07:32:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2024-10-24 07:32:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 07:32:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 228 transitions. [2024-10-24 07:32:02,947 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 228 transitions. Word has length 166 [2024-10-24 07:32:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:32:02,947 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 228 transitions. [2024-10-24 07:32:02,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-24 07:32:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 228 transitions. [2024-10-24 07:32:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 07:32:02,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:32:02,949 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:32:02,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 07:32:03,153 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,SelfDestructingSolverStorable8 [2024-10-24 07:32:03,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:32:03,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:32:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2083815520, now seen corresponding path program 1 times [2024-10-24 07:32:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:32:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41519656] [2024-10-24 07:32:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:32:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:32:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:32:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547245265] [2024-10-24 07:32:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:32:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:32:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:32:03,222 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-24 07:32:03,223 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-24 07:32:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:32:03,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:32:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:32:03,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:32:03,503 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:32:03,504 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:32:03,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 07:32:03,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:32:03,709 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:32:03,856 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:32:03,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:32:03 BoogieIcfgContainer [2024-10-24 07:32:03,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:32:03,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:32:03,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:32:03,859 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:32:03,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:31:53" (3/4) ... [2024-10-24 07:32:03,861 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:32:03,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:32:03,862 INFO L158 Benchmark]: Toolchain (without parser) took 11168.19ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 69.8MB in the beginning and 104.0MB in the end (delta: -34.2MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2024-10-24 07:32:03,862 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:32:03,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.91ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 52.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 07:32:03,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.09ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 49.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:32:03,862 INFO L158 Benchmark]: Boogie Preprocessor took 100.29ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 49.2MB in the beginning and 171.3MB in the end (delta: -122.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-24 07:32:03,862 INFO L158 Benchmark]: RCFGBuilder took 611.24ms. Allocated memory is still 203.4MB. Free memory was 171.2MB in the beginning and 143.1MB in the end (delta: 28.1MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-10-24 07:32:03,863 INFO L158 Benchmark]: TraceAbstraction took 10042.07ms. Allocated memory was 203.4MB in the beginning and 318.8MB in the end (delta: 115.3MB). Free memory was 143.1MB in the beginning and 104.0MB in the end (delta: 39.1MB). Peak memory consumption was 155.5MB. Max. memory is 16.1GB. [2024-10-24 07:32:03,863 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 318.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:32:03,864 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.13ms. Allocated memory is still 142.6MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.91ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 52.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.09ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 49.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.29ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 49.2MB in the beginning and 171.3MB in the end (delta: -122.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * RCFGBuilder took 611.24ms. Allocated memory is still 203.4MB. Free memory was 171.2MB in the beginning and 143.1MB in the end (delta: 28.1MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10042.07ms. Allocated memory was 203.4MB in the beginning and 318.8MB in the end (delta: 115.3MB). Free memory was 143.1MB in the beginning and 104.0MB in the end (delta: 39.1MB). Peak memory consumption was 155.5MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 318.8MB. Free memory is still 104.0MB. 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 bitwiseOr at line 85, overapproximation of someUnaryDOUBLEoperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someUnaryFLOAToperation at line 95, overapproximation of someBinaryArithmeticFLOAToperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_28 = 64; [L44] float var_1_33 = 10.775; [L45] unsigned long int var_1_41 = 256; [L46] unsigned long int var_1_45 = 64; [L47] double var_1_46 = 31.1; [L48] signed char var_1_47 = 50; [L49] signed char var_1_48 = 16; [L50] double last_1_var_1_22 = 200.8; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L174] last_1_var_1_22 = var_1_22 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L134] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L136] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L137] var_1_6 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L138] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L140] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L143] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L146] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L152] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L156] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L158] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L159] var_1_23 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L160] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L162] var_1_24 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L163] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L165] var_1_28 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L166] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L169] var_1_48 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_48 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L170] RET assume_abort_if_not(var_1_48 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] CALL assume_abort_if_not(var_1_48 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] RET assume_abort_if_not(var_1_48 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L185] RET updateVariables() [L186] CALL step() [L54] COND TRUE ! (var_1_4 < 16.8f) [L55] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] EXPR var_1_25 ^ (var_1_28 + var_1_24) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] COND TRUE (var_1_25 ^ (var_1_28 + var_1_24)) <= (((((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) < 0 ) ? -((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) : ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))))) [L58] var_1_33 = (((((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))) < 0 ) ? -((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))) : ((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L66] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=2, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L75] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L76] EXPR var_1_25 & var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L76] COND TRUE (var_1_25 & var_1_25) <= var_1_25 [L77] COND FALSE !(var_1_19 <= var_1_5) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L86] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L94] COND TRUE var_1_24 != var_1_25 [L95] var_1_46 = ((((((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) < 0 ) ? -(((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : (((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L99] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L102] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L103] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L108] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L109] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L116] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L118] var_1_45 = var_1_23 [L119] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L120] COND TRUE stepLocal_0 || var_1_7 [L121] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L123] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L124] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=0, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L126] COND TRUE (var_1_25 % var_1_28) >= var_1_25 [L127] var_1_26 = (var_1_7 || var_1_11) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L177-L178] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32767, var_1_24=32766, var_1_25=32767, var_1_26=1, var_1_28=-32766, var_1_33=3, var_1_41=256, var_1_45=32767, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1782 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1735 mSDsluCounter, 3964 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2651 mSDsCounter, 628 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3050 IncrementalHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 628 mSolverCounterUnsat, 1313 mSDtfsCounter, 3050 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1199 GetRequests, 1121 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 205 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2117 ConstructedInterpolants, 0 QuantifiedInterpolants, 4629 SizeOfPredicates, 3 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 14208/14352 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-24 07:32:03,899 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-pr-ci_file-75.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 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:32:06,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:32:06,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:32:06,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:32:06,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:32:06,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:32:06,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:32:06,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:32:06,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:32:06,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:32:06,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:32:06,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:32:06,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:32:06,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:32:06,210 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:32:06,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:32:06,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:32:06,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:32:06,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:32:06,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:32:06,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:32:06,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:32:06,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:32:06,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:32:06,213 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:32:06,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:32:06,213 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:32:06,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:32:06,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:32:06,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:32:06,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:32:06,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:32:06,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:32:06,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:32:06,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:32:06,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:32:06,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:32:06,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:32:06,216 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:32:06,216 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:32:06,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:32:06,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:32:06,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:32:06,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:32:06,217 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:32:06,218 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 -> 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 [2024-10-24 07:32:06,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:32:06,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:32:06,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:32:06,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:32:06,523 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:32:06,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-24 07:32:07,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:32:08,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:32:08,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-24 07:32:08,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb148d4b/09fa19c24ee448b7a406224efbe5fc9d/FLAGbfc264c00 [2024-10-24 07:32:08,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb148d4b/09fa19c24ee448b7a406224efbe5fc9d [2024-10-24 07:32:08,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:32:08,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:32:08,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:32:08,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:32:08,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:32:08,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25463627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08, skipping insertion in model container [2024-10-24 07:32:08,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:32:08,399 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-pr-ci_file-75.i[919,932] [2024-10-24 07:32:08,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:32:08,494 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:32:08,508 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-pr-ci_file-75.i[919,932] [2024-10-24 07:32:08,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:32:08,575 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:32:08,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08 WrapperNode [2024-10-24 07:32:08,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:32:08,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:32:08,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:32:08,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:32:08,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,639 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-24 07:32:08,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:32:08,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:32:08,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:32:08,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:32:08,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,677 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-24 07:32:08,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:32:08,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:32:08,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:32:08,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:32:08,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (1/1) ... [2024-10-24 07:32:08,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:32:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:32:08,757 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-24 07:32:08,765 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-24 07:32:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:32:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:32:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:32:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:32:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:32:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:32:08,914 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:32:08,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:32:30,750 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 07:32:30,750 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:32:30,811 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:32:30,811 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:32:30,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:32:30 BoogieIcfgContainer [2024-10-24 07:32:30,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:32:30,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:32:30,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:32:30,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:32:30,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:32:08" (1/3) ... [2024-10-24 07:32:30,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e60a246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:32:30, skipping insertion in model container [2024-10-24 07:32:30,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:08" (2/3) ... [2024-10-24 07:32:30,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e60a246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:32:30, skipping insertion in model container [2024-10-24 07:32:30,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:32:30" (3/3) ... [2024-10-24 07:32:30,820 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-10-24 07:32:30,833 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:32:30,833 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:32:30,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:32:30,887 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;@7f0e8b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:32:30,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:32:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 07:32:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 07:32:30,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:32:30,902 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:32:30,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:32:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:32:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1248243038, now seen corresponding path program 1 times [2024-10-24 07:32:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:32:30,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821280990] [2024-10-24 07:32:30,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:32:30,918 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-24 07:32:30,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:32:30,921 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-24 07:32:30,922 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-24 07:32:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:31,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:32:31,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:32:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-24 07:32:31,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:32:31,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:32:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821280990] [2024-10-24 07:32:31,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821280990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:32:31,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:32:31,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:32:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630612287] [2024-10-24 07:32:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:32:31,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:32:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:32:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:32:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:32:31,641 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 07:32:35,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:32:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:32:35,920 INFO L93 Difference]: Finished difference Result 147 states and 264 transitions. [2024-10-24 07:32:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:32:36,011 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2024-10-24 07:32:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:32:36,017 INFO L225 Difference]: With dead ends: 147 [2024-10-24 07:32:36,017 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 07:32:36,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-24 07:32:36,021 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:32:36,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 07:32:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 07:32:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 07:32:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 07:32:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2024-10-24 07:32:36,059 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 154 [2024-10-24 07:32:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:32:36,059 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2024-10-24 07:32:36,060 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 07:32:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2024-10-24 07:32:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 07:32:36,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:32:36,063 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:32:36,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 07:32:36,266 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-24 07:32:36,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:32:36,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:32:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2101981347, now seen corresponding path program 1 times [2024-10-24 07:32:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:32:36,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205453176] [2024-10-24 07:32:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:32:36,269 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-24 07:32:36,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:32:36,272 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-24 07:32:36,273 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-24 07:32:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:32:37,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 07:32:37,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:33:17,901 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:33:26,046 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)