./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_codestructure_normal_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:30:44,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:30:44,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:30:44,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:30:44,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:30:44,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:30:44,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:30:44,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:30:44,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:30:44,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:30:44,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:30:44,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:30:44,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:30:44,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:30:44,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:30:44,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:30:44,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:30:44,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:30:44,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:30:44,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:30:44,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:30:44,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:30:44,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:30:44,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:30:44,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:30:44,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:30:44,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:30:44,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:30:44,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:30:44,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:30:44,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:30:44,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:30:44,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:30:44,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:30:44,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:30:44,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:30:44,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:30:44,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:30:44,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:30:44,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:30:44,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:30:44,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:30:44,147 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-11-20 02:30:44,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:30:44,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:30:44,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:30:44,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:30:44,380 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:30:44,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-20 02:30:45,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:30:45,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:30:45,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-20 02:30:45,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47df45a2/d7b35252c787409abdffd13ef04859a9/FLAG7f9b19682 [2024-11-20 02:30:45,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47df45a2/d7b35252c787409abdffd13ef04859a9 [2024-11-20 02:30:45,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:30:45,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:30:45,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:30:45,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:30:45,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:30:45,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:30:45" (1/1) ... [2024-11-20 02:30:45,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9164fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:45, skipping insertion in model container [2024-11-20 02:30:45,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:30:45" (1/1) ... [2024-11-20 02:30:45,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:30:46,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-11-20 02:30:46,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:30:46,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:30:46,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-11-20 02:30:46,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:30:46,156 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:30:46,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46 WrapperNode [2024-11-20 02:30:46,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:30:46,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:30:46,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:30:46,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:30:46,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,217 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-20 02:30:46,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:30:46,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:30:46,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:30:46,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:30:46,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,248 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:30:46,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:30:46,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:30:46,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:30:46,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:30:46,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (1/1) ... [2024-11-20 02:30:46,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:30:46,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:30:46,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:30:46,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:30:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:30:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:30:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:30:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:30:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:30:46,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:30:46,397 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:30:46,398 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:30:46,680 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:30:46,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:30:46,691 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:30:46,691 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:30:46,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:30:46 BoogieIcfgContainer [2024-11-20 02:30:46,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:30:46,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:30:46,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:30:46,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:30:46,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:30:45" (1/3) ... [2024-11-20 02:30:46,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a2bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:30:46, skipping insertion in model container [2024-11-20 02:30:46,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:46" (2/3) ... [2024-11-20 02:30:46,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a2bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:30:46, skipping insertion in model container [2024-11-20 02:30:46,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:30:46" (3/3) ... [2024-11-20 02:30:46,702 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-11-20 02:30:46,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:30:46,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:30:46,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:30:46,768 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;@37383326, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:30:46,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:30:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:30:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 02:30:46,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:46,783 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:30:46,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1412883533, now seen corresponding path program 1 times [2024-11-20 02:30:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:30:46,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777449392] [2024-11-20 02:30:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:30:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:30:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:30:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:30:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:30:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:30:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:30:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:30:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:30:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:30:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:30:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:30:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:30:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:30:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:30:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:30:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:30:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:30:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:30:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:30:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:30:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:30:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:30:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:30:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:30:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:30:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:30:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:30:47,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:30:47,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777449392] [2024-11-20 02:30:47,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777449392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:30:47,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:30:47,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:30:47,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58726367] [2024-11-20 02:30:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:30:47,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:30:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:30:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:30:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:30:47,193 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:30:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:30:47,217 INFO L93 Difference]: Finished difference Result 133 states and 240 transitions. [2024-11-20 02:30:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:30:47,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-11-20 02:30:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:30:47,227 INFO L225 Difference]: With dead ends: 133 [2024-11-20 02:30:47,229 INFO L226 Difference]: Without dead ends: 66 [2024-11-20 02:30:47,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:30:47,251 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:30:47,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:30:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-20 02:30:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-20 02:30:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:30:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2024-11-20 02:30:47,286 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 160 [2024-11-20 02:30:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:30:47,287 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2024-11-20 02:30:47,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:30:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-11-20 02:30:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 02:30:47,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:47,290 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:30:47,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:30:47,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:47,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2025399539, now seen corresponding path program 1 times [2024-11-20 02:30:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:30:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466112297] [2024-11-20 02:30:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:30:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:31:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:31:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:31:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:31:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:31:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:31:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:31:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:31:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:31:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:31:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:31:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:31:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:31:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:31:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:31:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:31:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:31:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:31:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:31:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:31:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:31:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:31:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:31:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:31:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:31:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:31:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:31:04,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:31:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466112297] [2024-11-20 02:31:04,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466112297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:31:04,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:31:04,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 02:31:04,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711209023] [2024-11-20 02:31:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:31:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 02:31:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:31:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 02:31:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:31:04,329 INFO L87 Difference]: Start difference. First operand 66 states and 103 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:31:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:31:05,501 INFO L93 Difference]: Finished difference Result 123 states and 185 transitions. [2024-11-20 02:31:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 02:31:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-11-20 02:31:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:31:05,507 INFO L225 Difference]: With dead ends: 123 [2024-11-20 02:31:05,510 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 02:31:05,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:31:05,511 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 134 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:31:05,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 469 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:31:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 02:31:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2024-11-20 02:31:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:31:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2024-11-20 02:31:05,526 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 160 [2024-11-20 02:31:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:31:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2024-11-20 02:31:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:31:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2024-11-20 02:31:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 02:31:05,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:31:05,533 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:31:05,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:31:05,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:31:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:31:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1345341169, now seen corresponding path program 1 times [2024-11-20 02:31:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:31:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359923761] [2024-11-20 02:31:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:31:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:31:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:31:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:31:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:31:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:31:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:31:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:31:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:31:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:31:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:31:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:31:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:31:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:31:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:31:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:31:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:31:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:31:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:31:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:31:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:31:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:31:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:31:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:31:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:31:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:31:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:31:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:31:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:31:05,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:31:05,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359923761] [2024-11-20 02:31:05,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359923761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:31:05,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:31:05,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:31:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691073850] [2024-11-20 02:31:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:31:05,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:31:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:31:05,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:31:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:31:05,905 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-20 02:31:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:31:06,081 INFO L93 Difference]: Finished difference Result 182 states and 286 transitions. [2024-11-20 02:31:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:31:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 160 [2024-11-20 02:31:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:31:06,084 INFO L225 Difference]: With dead ends: 182 [2024-11-20 02:31:06,084 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 02:31:06,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:31:06,085 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 138 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:31:06,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 150 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:31:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 02:31:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-20 02:31:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 02:31:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2024-11-20 02:31:06,103 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 160 [2024-11-20 02:31:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:31:06,104 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2024-11-20 02:31:06,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-20 02:31:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2024-11-20 02:31:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 02:31:06,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:31:06,106 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:31:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:31:06,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:31:06,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:31:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1649506112, now seen corresponding path program 1 times [2024-11-20 02:31:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:31:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269590623] [2024-11-20 02:31:06,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:31:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:31:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:31:06,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544998673] [2024-11-20 02:31:06,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:31:06,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:31:06,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:31:06,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:31:06,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:31:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:31:06,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:31:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:31:06,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:31:06,514 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:31:06,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:31:06,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:31:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:31:06,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 02:31:06,802 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:31:06,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:31:06 BoogieIcfgContainer [2024-11-20 02:31:06,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:31:06,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:31:06,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:31:06,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:31:06,808 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:30:46" (3/4) ... [2024-11-20 02:31:06,810 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:31:06,811 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:31:06,812 INFO L158 Benchmark]: Toolchain (without parser) took 20956.91ms. Allocated memory was 176.2MB in the beginning and 700.4MB in the end (delta: 524.3MB). Free memory was 105.9MB in the beginning and 456.2MB in the end (delta: -350.3MB). Peak memory consumption was 178.3MB. Max. memory is 16.1GB. [2024-11-20 02:31:06,812 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:31:06,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.58ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 90.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:31:06,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.38ms. Allocated memory is still 176.2MB. Free memory was 90.4MB in the beginning and 87.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:31:06,814 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 176.2MB. Free memory was 87.1MB in the beginning and 82.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:31:06,814 INFO L158 Benchmark]: RCFGBuilder took 427.62ms. Allocated memory is still 176.2MB. Free memory was 82.3MB in the beginning and 139.9MB in the end (delta: -57.6MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-20 02:31:06,814 INFO L158 Benchmark]: TraceAbstraction took 20110.95ms. Allocated memory was 176.2MB in the beginning and 700.4MB in the end (delta: 524.3MB). Free memory was 139.4MB in the beginning and 456.2MB in the end (delta: -316.8MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. [2024-11-20 02:31:06,814 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 700.4MB. Free memory is still 456.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:31:06,815 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.09ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.58ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 90.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.38ms. Allocated memory is still 176.2MB. Free memory was 90.4MB in the beginning and 87.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 176.2MB. Free memory was 87.1MB in the beginning and 82.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 427.62ms. Allocated memory is still 176.2MB. Free memory was 82.3MB in the beginning and 139.9MB in the end (delta: -57.6MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20110.95ms. Allocated memory was 176.2MB in the beginning and 700.4MB in the end (delta: 524.3MB). Free memory was 139.4MB in the beginning and 456.2MB in the end (delta: -316.8MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 700.4MB. Free memory is still 456.2MB. 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 someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 10; [L26] double var_1_5 = 16.5; [L27] signed char var_1_6 = 64; [L28] signed char var_1_7 = 2; [L29] unsigned short int var_1_8 = 256; [L30] unsigned char var_1_9 = 0; [L31] unsigned short int var_1_10 = 63583; [L32] unsigned short int var_1_11 = 33789; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] signed long int var_1_15 = 8; [L37] signed short int var_1_16 = -16; [L38] unsigned short int var_1_17 = 32; [L39] signed short int var_1_18 = 16; [L40] signed short int var_1_19 = 25; [L41] signed short int var_1_20 = 25; [L42] signed short int var_1_21 = 50; VAL [isInitial=0, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=0, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L90] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L92] var_1_4 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L93] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L95] var_1_6 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L96] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L97] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L98] var_1_7 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L99] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L100] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L101] var_1_9 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L102] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L103] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L104] var_1_10 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L105] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L106] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L107] var_1_11 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L108] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L109] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L110] var_1_13 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L111] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L112] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L113] var_1_14 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L115] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L117] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L119] var_1_20 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L121] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L122] var_1_21 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L123] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L124] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L49] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L50] COND TRUE \read(var_1_2) [L51] var_1_5 = 8.25 VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L54] COND FALSE !(-25 == var_1_6) [L59] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L61] COND TRUE var_1_8 >= var_1_7 [L62] var_1_12 = (! var_1_14) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L64] COND TRUE -64 > (var_1_6 + var_1_1) [L65] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L73] COND FALSE !(var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L76] COND TRUE var_1_1 < var_1_6 [L77] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L81] COND TRUE \read(var_1_13) [L82] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_2 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_2 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((var_1_2 && var_1_9) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_1)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_13 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 722 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 300 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 2742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:31:06,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:31:08,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:31:08,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:31:08,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:31:08,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:31:08,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:31:08,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:31:08,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:31:08,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:31:08,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:31:08,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:31:08,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:31:08,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:31:08,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:31:08,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:31:08,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:31:08,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:31:08,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:31:08,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:31:08,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:31:08,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:31:08,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:31:08,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:31:08,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:31:08,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:31:08,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:31:08,917 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:31:08,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:31:08,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:31:08,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:31:08,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:31:08,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:31:08,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:31:08,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:31:08,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:31:08,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:31:08,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:31:08,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:31:08,923 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:31:08,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:31:08,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:31:08,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:31:08,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:31:08,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:31:08,925 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-11-20 02:31:09,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:31:09,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:31:09,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:31:09,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:31:09,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:31:09,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-20 02:31:10,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:31:10,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:31:10,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-20 02:31:10,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956860e7d/747cd6cdce59479e9af74f67b3b5e56e/FLAGd0ec96361 [2024-11-20 02:31:11,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956860e7d/747cd6cdce59479e9af74f67b3b5e56e [2024-11-20 02:31:11,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:31:11,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:31:11,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:31:11,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:31:11,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:31:11,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1150c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11, skipping insertion in model container [2024-11-20 02:31:11,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:31:11,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-11-20 02:31:11,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:31:11,327 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:31:11,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-11-20 02:31:11,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:31:11,390 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:31:11,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11 WrapperNode [2024-11-20 02:31:11,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:31:11,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:31:11,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:31:11,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:31:11,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,440 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-20 02:31:11,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:31:11,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:31:11,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:31:11,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:31:11,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,487 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:31:11,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:31:11,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:31:11,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:31:11,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:31:11,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (1/1) ... [2024-11-20 02:31:11,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:31:11,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:31:11,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:31:11,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:31:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:31:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:31:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:31:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:31:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:31:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:31:11,657 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:31:11,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:31:11,951 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:31:11,951 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:31:11,964 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:31:11,965 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:31:11,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:31:11 BoogieIcfgContainer [2024-11-20 02:31:11,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:31:11,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:31:11,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:31:11,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:31:11,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:31:11" (1/3) ... [2024-11-20 02:31:11,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185712d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:31:11, skipping insertion in model container [2024-11-20 02:31:11,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:11" (2/3) ... [2024-11-20 02:31:11,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185712d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:31:11, skipping insertion in model container [2024-11-20 02:31:11,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:31:11" (3/3) ... [2024-11-20 02:31:11,970 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-11-20 02:31:11,984 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:31:11,985 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:31:12,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:31:12,043 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;@1a2e7055, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:31:12,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:31:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:31:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 02:31:12,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:31:12,058 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:31:12,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:31:12,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:31:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1412883533, now seen corresponding path program 1 times [2024-11-20 02:31:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:31:12,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071066980] [2024-11-20 02:31:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:31:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:31:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:31:12,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:31:12,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:31:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:12,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:31:12,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:31:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-20 02:31:12,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:31:12,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:31:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071066980] [2024-11-20 02:31:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071066980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:31:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:31:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:31:12,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720215774] [2024-11-20 02:31:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:31:12,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:31:12,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:31:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:31:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:31:12,331 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:31:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:31:12,354 INFO L93 Difference]: Finished difference Result 133 states and 240 transitions. [2024-11-20 02:31:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:31:12,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-11-20 02:31:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:31:12,361 INFO L225 Difference]: With dead ends: 133 [2024-11-20 02:31:12,361 INFO L226 Difference]: Without dead ends: 66 [2024-11-20 02:31:12,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:31:12,366 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:31:12,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:31:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-20 02:31:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-20 02:31:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:31:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2024-11-20 02:31:12,403 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 160 [2024-11-20 02:31:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:31:12,403 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2024-11-20 02:31:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:31:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-11-20 02:31:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 02:31:12,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:31:12,408 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:31:12,414 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-11-20 02:31:12,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:31:12,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:31:12,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:31:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2025399539, now seen corresponding path program 1 times [2024-11-20 02:31:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:31:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881509812] [2024-11-20 02:31:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:31:12,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:31:12,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:31:12,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:31:12,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:31:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:31:12,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 02:31:12,801 INFO L278 TraceCheckSpWp]: Computing forward predicates...