./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:34:15,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:34:15,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:34:15,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:34:15,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:34:15,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:34:15,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:34:15,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:34:15,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:34:15,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:34:15,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:34:15,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:34:15,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:34:15,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:34:15,996 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:34:15,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:34:15,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:34:15,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:34:15,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:34:15,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:34:15,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:34:15,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:34:16,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:34:16,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:34:16,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:34:16,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:34:16,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:34:16,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:34:16,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:34:16,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:34:16,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:34:16,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:34:16,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:34:16,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:34:16,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:34:16,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:34:16,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:34:16,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:34:16,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:34:16,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:34:16,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:34:16,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:34:16,007 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-clean/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-clean/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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2024-10-11 12:34:16,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:34:16,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:34:16,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:34:16,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:34:16,324 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:34:16,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-10-11 12:34:17,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:34:17,972 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:34:17,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-10-11 12:34:17,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80f01f499/0f0b4267a13242e5a1a6a750dae89695/FLAG735077f84 [2024-10-11 12:34:18,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80f01f499/0f0b4267a13242e5a1a6a750dae89695 [2024-10-11 12:34:18,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:34:18,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:34:18,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:34:18,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:34:18,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:34:18,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eafc4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18, skipping insertion in model container [2024-10-11 12:34:18,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:34:18,562 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-10-11 12:34:18,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:34:18,642 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:34:18,654 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-10-11 12:34:18,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:34:18,712 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:34:18,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18 WrapperNode [2024-10-11 12:34:18,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:34:18,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:34:18,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:34:18,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:34:18,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,792 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-11 12:34:18,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:34:18,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:34:18,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:34:18,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:34:18,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,844 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:34:18,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:34:18,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:34:18,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:34:18,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:34:18,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (1/1) ... [2024-10-11 12:34:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:34:18,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:34:18,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:34:18,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:34:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:34:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:34:18,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:34:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:34:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:34:18,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:34:19,058 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:34:19,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:34:19,519 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 12:34:19,519 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:34:19,555 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:34:19,557 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:34:19,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:19 BoogieIcfgContainer [2024-10-11 12:34:19,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:34:19,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:34:19,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:34:19,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:34:19,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:34:18" (1/3) ... [2024-10-11 12:34:19,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5ecd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:19, skipping insertion in model container [2024-10-11 12:34:19,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:18" (2/3) ... [2024-10-11 12:34:19,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5ecd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:19, skipping insertion in model container [2024-10-11 12:34:19,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:19" (3/3) ... [2024-10-11 12:34:19,568 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2024-10-11 12:34:19,582 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:34:19,582 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:34:19,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:34:19,639 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;@5a93f133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:34:19,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:34:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:34:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 12:34:19,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:19,657 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:19,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1421017430, now seen corresponding path program 1 times [2024-10-11 12:34:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467773000] [2024-10-11 12:34:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467773000] [2024-10-11 12:34:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467773000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:34:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107645145] [2024-10-11 12:34:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:20,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:34:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:20,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:34:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:34:20,054 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:20,103 INFO L93 Difference]: Finished difference Result 143 states and 240 transitions. [2024-10-11 12:34:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:34:20,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-10-11 12:34:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:20,115 INFO L225 Difference]: With dead ends: 143 [2024-10-11 12:34:20,115 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 12:34:20,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:34:20,124 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:20,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:34:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 12:34:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 12:34:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:34:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-10-11 12:34:20,183 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 106 [2024-10-11 12:34:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:20,184 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-10-11 12:34:20,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-10-11 12:34:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 12:34:20,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:20,192 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:20,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:34:20,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:20,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash -843440470, now seen corresponding path program 1 times [2024-10-11 12:34:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:20,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143137704] [2024-10-11 12:34:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:20,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143137704] [2024-10-11 12:34:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143137704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:20,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:34:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972405157] [2024-10-11 12:34:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:20,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:34:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:20,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:34:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:34:20,755 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:20,928 INFO L93 Difference]: Finished difference Result 246 states and 374 transitions. [2024-10-11 12:34:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:34:20,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-11 12:34:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:20,935 INFO L225 Difference]: With dead ends: 246 [2024-10-11 12:34:20,935 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 12:34:20,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:34:20,937 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 137 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:20,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 352 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 12:34:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2024-10-11 12:34:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 12:34:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2024-10-11 12:34:20,969 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 106 [2024-10-11 12:34:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:20,970 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2024-10-11 12:34:20,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2024-10-11 12:34:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 12:34:20,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:20,975 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:20,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:34:20,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:20,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1864508824, now seen corresponding path program 1 times [2024-10-11 12:34:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:20,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421056522] [2024-10-11 12:34:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:20,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421056522] [2024-10-11 12:34:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421056522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:21,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:34:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962205821] [2024-10-11 12:34:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:21,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:34:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:34:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:34:21,284 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:21,458 INFO L93 Difference]: Finished difference Result 393 states and 603 transitions. [2024-10-11 12:34:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:34:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-11 12:34:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:21,462 INFO L225 Difference]: With dead ends: 393 [2024-10-11 12:34:21,462 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 12:34:21,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:34:21,468 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 121 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:21,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 387 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 12:34:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 185. [2024-10-11 12:34:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 133 states have (on average 1.413533834586466) internal successors, (188), 133 states have internal predecessors, (188), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:34:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2024-10-11 12:34:21,508 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 106 [2024-10-11 12:34:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:21,509 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2024-10-11 12:34:21,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2024-10-11 12:34:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 12:34:21,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:21,511 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:21,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:34:21,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:21,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash 497463978, now seen corresponding path program 1 times [2024-10-11 12:34:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483700473] [2024-10-11 12:34:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:21,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483700473] [2024-10-11 12:34:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483700473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:34:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111653625] [2024-10-11 12:34:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:21,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:34:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:34:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:21,735 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:21,793 INFO L93 Difference]: Finished difference Result 389 states and 599 transitions. [2024-10-11 12:34:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:34:21,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-11 12:34:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:21,798 INFO L225 Difference]: With dead ends: 389 [2024-10-11 12:34:21,800 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 12:34:21,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:21,802 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 72 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:21,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 192 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:34:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 12:34:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-11 12:34:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 12:34:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 380 transitions. [2024-10-11 12:34:21,835 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 380 transitions. Word has length 107 [2024-10-11 12:34:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:21,836 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 380 transitions. [2024-10-11 12:34:21,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 380 transitions. [2024-10-11 12:34:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 12:34:21,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:21,843 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:21,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:34:21,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -574531572, now seen corresponding path program 1 times [2024-10-11 12:34:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190675496] [2024-10-11 12:34:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190675496] [2024-10-11 12:34:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190675496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:22,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:34:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703330585] [2024-10-11 12:34:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:22,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:34:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:34:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:34:22,558 INFO L87 Difference]: Start difference. First operand 249 states and 380 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:22,833 INFO L93 Difference]: Finished difference Result 565 states and 852 transitions. [2024-10-11 12:34:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:34:22,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-11 12:34:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:22,836 INFO L225 Difference]: With dead ends: 565 [2024-10-11 12:34:22,836 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 12:34:22,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:34:22,840 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 127 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:22,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 308 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:34:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 12:34:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 325. [2024-10-11 12:34:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 256 states have (on average 1.4140625) internal successors, (362), 256 states have internal predecessors, (362), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 12:34:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 490 transitions. [2024-10-11 12:34:22,879 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 490 transitions. Word has length 107 [2024-10-11 12:34:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:22,883 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 490 transitions. [2024-10-11 12:34:22,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 490 transitions. [2024-10-11 12:34:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:34:22,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:22,885 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:22,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:34:22,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1536128081, now seen corresponding path program 1 times [2024-10-11 12:34:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:22,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781522732] [2024-10-11 12:34:22,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:22,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781522732] [2024-10-11 12:34:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781522732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:34:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20635459] [2024-10-11 12:34:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:34:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:34:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:34:23,248 INFO L87 Difference]: Start difference. First operand 325 states and 490 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:23,383 INFO L93 Difference]: Finished difference Result 659 states and 997 transitions. [2024-10-11 12:34:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:34:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-11 12:34:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:23,387 INFO L225 Difference]: With dead ends: 659 [2024-10-11 12:34:23,387 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 12:34:23,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:34:23,390 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:23,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 298 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 12:34:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 343. [2024-10-11 12:34:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 274 states have internal predecessors, (389), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 12:34:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 517 transitions. [2024-10-11 12:34:23,419 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 517 transitions. Word has length 108 [2024-10-11 12:34:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:23,419 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 517 transitions. [2024-10-11 12:34:23,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 517 transitions. [2024-10-11 12:34:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 12:34:23,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:23,421 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:34:23,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:23,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1239172888, now seen corresponding path program 1 times [2024-10-11 12:34:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883868768] [2024-10-11 12:34:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:23,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883868768] [2024-10-11 12:34:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883868768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:23,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:34:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932211071] [2024-10-11 12:34:23,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:34:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:34:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:34:23,607 INFO L87 Difference]: Start difference. First operand 343 states and 517 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:23,764 INFO L93 Difference]: Finished difference Result 718 states and 1080 transitions. [2024-10-11 12:34:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:34:23,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-11 12:34:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:23,767 INFO L225 Difference]: With dead ends: 718 [2024-10-11 12:34:23,767 INFO L226 Difference]: Without dead ends: 431 [2024-10-11 12:34:23,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:34:23,772 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 86 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:23,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 390 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-11 12:34:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 383. [2024-10-11 12:34:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 314 states have (on average 1.4171974522292994) internal successors, (445), 314 states have internal predecessors, (445), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 12:34:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 573 transitions. [2024-10-11 12:34:23,802 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 573 transitions. Word has length 111 [2024-10-11 12:34:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:23,816 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 573 transitions. [2024-10-11 12:34:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 573 transitions. [2024-10-11 12:34:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:34:23,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:23,820 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:34:23,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:23,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1474366651, now seen corresponding path program 1 times [2024-10-11 12:34:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97158046] [2024-10-11 12:34:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97158046] [2024-10-11 12:34:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97158046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:26,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 12:34:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446653196] [2024-10-11 12:34:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:26,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 12:34:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 12:34:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:34:26,198 INFO L87 Difference]: Start difference. First operand 383 states and 573 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:28,415 INFO L93 Difference]: Finished difference Result 806 states and 1195 transitions. [2024-10-11 12:34:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 12:34:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-11 12:34:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:28,419 INFO L225 Difference]: With dead ends: 806 [2024-10-11 12:34:28,419 INFO L226 Difference]: Without dead ends: 519 [2024-10-11 12:34:28,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-11 12:34:28,422 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 145 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:28,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 665 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 12:34:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-10-11 12:34:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 427. [2024-10-11 12:34:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 358 states have (on average 1.399441340782123) internal successors, (501), 358 states have internal predecessors, (501), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 12:34:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 629 transitions. [2024-10-11 12:34:28,459 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 629 transitions. Word has length 112 [2024-10-11 12:34:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 629 transitions. [2024-10-11 12:34:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 629 transitions. [2024-10-11 12:34:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:34:28,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:28,462 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:28,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:34:28,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:28,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash -887560637, now seen corresponding path program 1 times [2024-10-11 12:34:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138059480] [2024-10-11 12:34:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138059480] [2024-10-11 12:34:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138059480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 12:34:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859011655] [2024-10-11 12:34:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:34:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:34:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:34:29,995 INFO L87 Difference]: Start difference. First operand 427 states and 629 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:31,998 INFO L93 Difference]: Finished difference Result 904 states and 1336 transitions. [2024-10-11 12:34:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:34:31,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-11 12:34:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:32,002 INFO L225 Difference]: With dead ends: 904 [2024-10-11 12:34:32,002 INFO L226 Difference]: Without dead ends: 617 [2024-10-11 12:34:32,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 12:34:32,004 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 53 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:32,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 730 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 12:34:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-11 12:34:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 492. [2024-10-11 12:34:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 423 states have (on average 1.4160756501182032) internal successors, (599), 423 states have internal predecessors, (599), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 12:34:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 727 transitions. [2024-10-11 12:34:32,029 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 727 transitions. Word has length 112 [2024-10-11 12:34:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:32,029 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 727 transitions. [2024-10-11 12:34:32,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 727 transitions. [2024-10-11 12:34:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 12:34:32,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:32,031 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:32,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 12:34:32,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash 447804669, now seen corresponding path program 1 times [2024-10-11 12:34:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:32,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754129736] [2024-10-11 12:34:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:32,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:32,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754129736] [2024-10-11 12:34:32,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754129736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:32,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:32,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:34:32,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196047951] [2024-10-11 12:34:32,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:32,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:34:32,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:32,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:34:32,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:34:32,265 INFO L87 Difference]: Start difference. First operand 492 states and 727 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:32,523 INFO L93 Difference]: Finished difference Result 1149 states and 1703 transitions. [2024-10-11 12:34:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:34:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-10-11 12:34:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:32,529 INFO L225 Difference]: With dead ends: 1149 [2024-10-11 12:34:32,529 INFO L226 Difference]: Without dead ends: 773 [2024-10-11 12:34:32,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:34:32,530 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:32,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 358 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:34:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-11 12:34:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 746. [2024-10-11 12:34:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 650 states have (on average 1.3846153846153846) internal successors, (900), 653 states have internal predecessors, (900), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 12:34:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1076 transitions. [2024-10-11 12:34:32,572 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1076 transitions. Word has length 113 [2024-10-11 12:34:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:32,572 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1076 transitions. [2024-10-11 12:34:32,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1076 transitions. [2024-10-11 12:34:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 12:34:32,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:32,574 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 12:34:32,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 914593284, now seen corresponding path program 1 times [2024-10-11 12:34:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252166735] [2024-10-11 12:34:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252166735] [2024-10-11 12:34:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252166735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:32,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:32,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:34:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960652614] [2024-10-11 12:34:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:34:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:32,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:34:32,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:34:32,910 INFO L87 Difference]: Start difference. First operand 746 states and 1076 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:33,329 INFO L93 Difference]: Finished difference Result 1566 states and 2281 transitions. [2024-10-11 12:34:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:34:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-10-11 12:34:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:33,338 INFO L225 Difference]: With dead ends: 1566 [2024-10-11 12:34:33,338 INFO L226 Difference]: Without dead ends: 976 [2024-10-11 12:34:33,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:34:33,340 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 156 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:33,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 423 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:34:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-11 12:34:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 807. [2024-10-11 12:34:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 710 states have (on average 1.408450704225352) internal successors, (1000), 713 states have internal predecessors, (1000), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 12:34:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1176 transitions. [2024-10-11 12:34:33,387 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1176 transitions. Word has length 113 [2024-10-11 12:34:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:33,388 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1176 transitions. [2024-10-11 12:34:33,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1176 transitions. [2024-10-11 12:34:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 12:34:33,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:33,390 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:33,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 12:34:33,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:33,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash -237537078, now seen corresponding path program 1 times [2024-10-11 12:34:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:33,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536338873] [2024-10-11 12:34:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:33,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:33,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536338873] [2024-10-11 12:34:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536338873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:33,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:33,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:34:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385514153] [2024-10-11 12:34:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:33,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:34:33,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:33,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:34:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:34:33,754 INFO L87 Difference]: Start difference. First operand 807 states and 1176 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:33,957 INFO L93 Difference]: Finished difference Result 1078 states and 1562 transitions. [2024-10-11 12:34:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:34:33,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 12:34:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:33,963 INFO L225 Difference]: With dead ends: 1078 [2024-10-11 12:34:33,963 INFO L226 Difference]: Without dead ends: 1076 [2024-10-11 12:34:33,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:34:33,964 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 62 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:33,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 580 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-10-11 12:34:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1072. [2024-10-11 12:34:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 931 states have (on average 1.3941997851772288) internal successors, (1298), 938 states have internal predecessors, (1298), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 121 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-11 12:34:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1554 transitions. [2024-10-11 12:34:34,069 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1554 transitions. Word has length 114 [2024-10-11 12:34:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1554 transitions. [2024-10-11 12:34:34,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1554 transitions. [2024-10-11 12:34:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 12:34:34,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:34,071 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:34,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 12:34:34,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:34,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1208751690, now seen corresponding path program 1 times [2024-10-11 12:34:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196927715] [2024-10-11 12:34:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196927715] [2024-10-11 12:34:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196927715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:34:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830728786] [2024-10-11 12:34:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:34,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:34:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:34:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:34,145 INFO L87 Difference]: Start difference. First operand 1072 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:34,261 INFO L93 Difference]: Finished difference Result 2248 states and 3230 transitions. [2024-10-11 12:34:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:34:34,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 12:34:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:34,268 INFO L225 Difference]: With dead ends: 2248 [2024-10-11 12:34:34,268 INFO L226 Difference]: Without dead ends: 1360 [2024-10-11 12:34:34,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:34,271 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:34,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 194 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:34:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-10-11 12:34:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1353. [2024-10-11 12:34:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1181 states have (on average 1.3564775613886537) internal successors, (1602), 1193 states have internal predecessors, (1602), 148 states have call successors, (148), 23 states have call predecessors, (148), 23 states have return successors, (148), 136 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 12:34:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1898 transitions. [2024-10-11 12:34:34,384 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1898 transitions. Word has length 114 [2024-10-11 12:34:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:34,385 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1898 transitions. [2024-10-11 12:34:34,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1898 transitions. [2024-10-11 12:34:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 12:34:34,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:34,387 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:34,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 12:34:34,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1491118622, now seen corresponding path program 1 times [2024-10-11 12:34:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583524278] [2024-10-11 12:34:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583524278] [2024-10-11 12:34:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583524278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:35,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:35,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:34:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135621636] [2024-10-11 12:34:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:35,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:34:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:34:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:34:35,426 INFO L87 Difference]: Start difference. First operand 1353 states and 1898 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:36,463 INFO L93 Difference]: Finished difference Result 3071 states and 4300 transitions. [2024-10-11 12:34:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 12:34:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 12:34:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:36,472 INFO L225 Difference]: With dead ends: 3071 [2024-10-11 12:34:36,473 INFO L226 Difference]: Without dead ends: 1951 [2024-10-11 12:34:36,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:34:36,476 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 63 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:36,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 708 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 12:34:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-10-11 12:34:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1862. [2024-10-11 12:34:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1633 states have (on average 1.3368034292712798) internal successors, (2183), 1651 states have internal predecessors, (2183), 196 states have call successors, (196), 32 states have call predecessors, (196), 32 states have return successors, (196), 178 states have call predecessors, (196), 196 states have call successors, (196) [2024-10-11 12:34:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2575 transitions. [2024-10-11 12:34:36,670 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2575 transitions. Word has length 114 [2024-10-11 12:34:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:36,671 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2575 transitions. [2024-10-11 12:34:36,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2575 transitions. [2024-10-11 12:34:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 12:34:36,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:36,673 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:36,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 12:34:36,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1792731424, now seen corresponding path program 1 times [2024-10-11 12:34:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532204028] [2024-10-11 12:34:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532204028] [2024-10-11 12:34:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532204028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:34:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547468691] [2024-10-11 12:34:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:34:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:34:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:34:37,281 INFO L87 Difference]: Start difference. First operand 1862 states and 2575 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:39,167 INFO L93 Difference]: Finished difference Result 3893 states and 5360 transitions. [2024-10-11 12:34:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 12:34:39,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 12:34:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:39,179 INFO L225 Difference]: With dead ends: 3893 [2024-10-11 12:34:39,179 INFO L226 Difference]: Without dead ends: 2329 [2024-10-11 12:34:39,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:34:39,183 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:39,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 689 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 12:34:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-10-11 12:34:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2317. [2024-10-11 12:34:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2058 states have (on average 1.3182701652089408) internal successors, (2713), 2086 states have internal predecessors, (2713), 216 states have call successors, (216), 42 states have call predecessors, (216), 42 states have return successors, (216), 188 states have call predecessors, (216), 216 states have call successors, (216) [2024-10-11 12:34:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3145 transitions. [2024-10-11 12:34:39,440 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3145 transitions. Word has length 114 [2024-10-11 12:34:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:39,441 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 3145 transitions. [2024-10-11 12:34:39,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3145 transitions. [2024-10-11 12:34:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 12:34:39,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:39,444 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:39,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 12:34:39,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash -723070538, now seen corresponding path program 1 times [2024-10-11 12:34:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447857671] [2024-10-11 12:34:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447857671] [2024-10-11 12:34:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447857671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:34:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275785606] [2024-10-11 12:34:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:39,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:34:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:34:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:39,522 INFO L87 Difference]: Start difference. First operand 2317 states and 3145 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:39,752 INFO L93 Difference]: Finished difference Result 4338 states and 5891 transitions. [2024-10-11 12:34:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:34:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 12:34:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:39,763 INFO L225 Difference]: With dead ends: 4338 [2024-10-11 12:34:39,763 INFO L226 Difference]: Without dead ends: 2359 [2024-10-11 12:34:39,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:39,769 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 49 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:39,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 244 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:34:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-10-11 12:34:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1916. [2024-10-11 12:34:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1704 states have (on average 1.3022300469483568) internal successors, (2219), 1719 states have internal predecessors, (2219), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-11 12:34:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2567 transitions. [2024-10-11 12:34:39,974 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2567 transitions. Word has length 114 [2024-10-11 12:34:39,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:39,974 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2567 transitions. [2024-10-11 12:34:39,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2567 transitions. [2024-10-11 12:34:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:34:39,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:39,977 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:39,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 12:34:39,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:39,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1230293769, now seen corresponding path program 1 times [2024-10-11 12:34:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:39,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136430111] [2024-10-11 12:34:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:40,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136430111] [2024-10-11 12:34:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136430111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:34:40,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910187769] [2024-10-11 12:34:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:34:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:40,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:34:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:40,038 INFO L87 Difference]: Start difference. First operand 1916 states and 2567 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:40,211 INFO L93 Difference]: Finished difference Result 3190 states and 4292 transitions. [2024-10-11 12:34:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:34:40,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 12:34:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:40,219 INFO L225 Difference]: With dead ends: 3190 [2024-10-11 12:34:40,220 INFO L226 Difference]: Without dead ends: 1505 [2024-10-11 12:34:40,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:34:40,224 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:40,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 246 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:34:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-11 12:34:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1501. [2024-10-11 12:34:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1266 states have (on average 1.2756714060031595) internal successors, (1615), 1283 states have internal predecessors, (1615), 186 states have call successors, (186), 48 states have call predecessors, (186), 48 states have return successors, (186), 169 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-11 12:34:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1987 transitions. [2024-10-11 12:34:40,440 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1987 transitions. Word has length 115 [2024-10-11 12:34:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:40,441 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1987 transitions. [2024-10-11 12:34:40,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1987 transitions. [2024-10-11 12:34:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:34:40,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:40,443 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:40,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 12:34:40,443 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 551078663, now seen corresponding path program 1 times [2024-10-11 12:34:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:40,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107489504] [2024-10-11 12:34:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:40,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:40,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107489504] [2024-10-11 12:34:40,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107489504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:40,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:40,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:34:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858598327] [2024-10-11 12:34:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:40,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 12:34:40,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 12:34:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:34:40,901 INFO L87 Difference]: Start difference. First operand 1501 states and 1987 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:41,515 INFO L93 Difference]: Finished difference Result 3031 states and 4020 transitions. [2024-10-11 12:34:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 12:34:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-11 12:34:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:41,524 INFO L225 Difference]: With dead ends: 3031 [2024-10-11 12:34:41,524 INFO L226 Difference]: Without dead ends: 1761 [2024-10-11 12:34:41,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-11 12:34:41,527 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:41,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 742 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:34:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2024-10-11 12:34:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1513. [2024-10-11 12:34:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1278 states have (on average 1.2730829420970267) internal successors, (1627), 1295 states have internal predecessors, (1627), 186 states have call successors, (186), 48 states have call predecessors, (186), 48 states have return successors, (186), 169 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-11 12:34:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1999 transitions. [2024-10-11 12:34:41,706 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1999 transitions. Word has length 115 [2024-10-11 12:34:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:41,706 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1999 transitions. [2024-10-11 12:34:41,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:34:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1999 transitions. [2024-10-11 12:34:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:34:41,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:41,708 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:41,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 12:34:41,709 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:41,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash -298199072, now seen corresponding path program 1 times [2024-10-11 12:34:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:41,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092655305] [2024-10-11 12:34:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:41,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092655305] [2024-10-11 12:34:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092655305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:42,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 12:34:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061261807] [2024-10-11 12:34:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:42,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 12:34:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 12:34:42,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:34:42,240 INFO L87 Difference]: Start difference. First operand 1513 states and 1999 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:42,950 INFO L93 Difference]: Finished difference Result 3013 states and 3997 transitions. [2024-10-11 12:34:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 12:34:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 12:34:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:42,960 INFO L225 Difference]: With dead ends: 3013 [2024-10-11 12:34:42,960 INFO L226 Difference]: Without dead ends: 1743 [2024-10-11 12:34:42,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-10-11 12:34:42,964 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 169 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:42,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 620 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:34:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-10-11 12:34:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1519. [2024-10-11 12:34:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1284 states have (on average 1.2718068535825544) internal successors, (1633), 1301 states have internal predecessors, (1633), 186 states have call successors, (186), 48 states have call predecessors, (186), 48 states have return successors, (186), 169 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-11 12:34:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2005 transitions. [2024-10-11 12:34:43,140 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2005 transitions. Word has length 115 [2024-10-11 12:34:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:43,140 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2005 transitions. [2024-10-11 12:34:43,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2005 transitions. [2024-10-11 12:34:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:34:43,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:43,142 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 12:34:43,143 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:43,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 171546644, now seen corresponding path program 1 times [2024-10-11 12:34:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:43,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93295269] [2024-10-11 12:34:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:34:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:34:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:34:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:34:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:34:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:34:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:34:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:34:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:34:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:34:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:34:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-11 12:34:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93295269] [2024-10-11 12:34:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93295269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:34:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31893714] [2024-10-11 12:34:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:43,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:34:43,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:34:43,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:34:43,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:34:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 12:34:43,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:34:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-10-11 12:34:43,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:34:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-11 12:34:43,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31893714] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:34:43,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:34:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-10-11 12:34:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476199978] [2024-10-11 12:34:43,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:34:43,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 12:34:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 12:34:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:34:43,936 INFO L87 Difference]: Start difference. First operand 1519 states and 2005 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 12:34:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:44,422 INFO L93 Difference]: Finished difference Result 3116 states and 4065 transitions. [2024-10-11 12:34:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 12:34:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 115 [2024-10-11 12:34:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:44,431 INFO L225 Difference]: With dead ends: 3116 [2024-10-11 12:34:44,431 INFO L226 Difference]: Without dead ends: 1639 [2024-10-11 12:34:44,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-10-11 12:34:44,434 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 212 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:44,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 229 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:34:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-10-11 12:34:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1551. [2024-10-11 12:34:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1308 states have (on average 1.253822629969419) internal successors, (1640), 1325 states have internal predecessors, (1640), 186 states have call successors, (186), 56 states have call predecessors, (186), 56 states have return successors, (186), 169 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-11 12:34:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2012 transitions. [2024-10-11 12:34:44,697 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2012 transitions. Word has length 115 [2024-10-11 12:34:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2012 transitions. [2024-10-11 12:34:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 12:34:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2012 transitions. [2024-10-11 12:34:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 12:34:44,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:44,698 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:44,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:34:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:34:44,900 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:44,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1423263236, now seen corresponding path program 1 times [2024-10-11 12:34:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:44,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23557021] [2024-10-11 12:34:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:34:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326366637] [2024-10-11 12:34:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:44,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:34:44,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:34:44,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:34:44,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:34:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:34:45,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:34:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:34:45,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:34:45,392 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:34:45,393 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:34:45,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:34:45,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:34:45,599 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:45,689 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:34:45,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:34:45 BoogieIcfgContainer [2024-10-11 12:34:45,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:34:45,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:34:45,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:34:45,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:34:45,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:19" (3/4) ... [2024-10-11 12:34:45,696 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:34:45,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:34:45,698 INFO L158 Benchmark]: Toolchain (without parser) took 27376.74ms. Allocated memory was 184.5MB in the beginning and 690.0MB in the end (delta: 505.4MB). Free memory was 149.6MB in the beginning and 540.0MB in the end (delta: -390.3MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2024-10-11 12:34:45,698 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:34:45,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.37ms. Allocated memory is still 184.5MB. Free memory was 149.4MB in the beginning and 144.1MB in the end (delta: 5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 12:34:45,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.00ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 140.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:34:45,699 INFO L158 Benchmark]: Boogie Preprocessor took 88.35ms. Allocated memory is still 184.5MB. Free memory was 140.1MB in the beginning and 135.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:34:45,699 INFO L158 Benchmark]: RCFGBuilder took 675.44ms. Allocated memory is still 184.5MB. Free memory was 135.6MB in the beginning and 132.7MB in the end (delta: 2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 12:34:45,699 INFO L158 Benchmark]: TraceAbstraction took 26132.71ms. Allocated memory was 184.5MB in the beginning and 690.0MB in the end (delta: 505.4MB). Free memory was 131.8MB in the beginning and 540.0MB in the end (delta: -408.2MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2024-10-11 12:34:45,699 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 690.0MB. Free memory is still 540.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:34:45,700 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.17ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.37ms. Allocated memory is still 184.5MB. Free memory was 149.4MB in the beginning and 144.1MB in the end (delta: 5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.00ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 140.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.35ms. Allocated memory is still 184.5MB. Free memory was 140.1MB in the beginning and 135.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 675.44ms. Allocated memory is still 184.5MB. Free memory was 135.6MB in the beginning and 132.7MB in the end (delta: 2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26132.71ms. Allocated memory was 184.5MB in the beginning and 690.0MB in the end (delta: 505.4MB). Free memory was 131.8MB in the beginning and 540.0MB in the end (delta: -408.2MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 690.0MB. Free memory is still 540.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L98] RET updateVariables() [L99] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L53] COND FALSE !((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) [L56] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=2, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=40, var_1_7=1, var_1_8=-16343, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1996 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1983 mSDsluCounter, 8460 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6191 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2854 IncrementalHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 2269 mSDtfsCounter, 2854 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1065 GetRequests, 924 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2317occurred in iteration=15, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 1770 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2578 NumberOfCodeBlocks, 2578 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2439 ConstructedInterpolants, 0 QuantifiedInterpolants, 13879 SizeOfPredicates, 4 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10530/10560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:34:45,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:34:47,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:34:48,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:34:48,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:34:48,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:34:48,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:34:48,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:34:48,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:34:48,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:34:48,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:34:48,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:34:48,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:34:48,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:34:48,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:34:48,072 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:34:48,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:34:48,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:34:48,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:34:48,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:34:48,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:34:48,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:34:48,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:34:48,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:34:48,080 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:34:48,080 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:34:48,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:34:48,081 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:34:48,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:34:48,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:34:48,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:34:48,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:34:48,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:34:48,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:34:48,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:34:48,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:34:48,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:34:48,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:34:48,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:34:48,083 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:34:48,083 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:34:48,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:34:48,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:34:48,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:34:48,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:34:48,086 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:34:48,087 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-clean/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-clean/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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2024-10-11 12:34:48,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:34:48,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:34:48,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:34:48,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:34:48,452 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:34:48,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-10-11 12:34:49,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:34:50,178 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:34:50,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-10-11 12:34:50,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b9d696ef/f1735d97ca3045569dae89661e482a91/FLAGd5fd54607 [2024-10-11 12:34:50,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b9d696ef/f1735d97ca3045569dae89661e482a91 [2024-10-11 12:34:50,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:34:50,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:34:50,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:34:50,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:34:50,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:34:50,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:50,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cbc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50, skipping insertion in model container [2024-10-11 12:34:50,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:50,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:34:50,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-10-11 12:34:50,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:34:50,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:34:50,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-10-11 12:34:50,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:34:50,909 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:34:50,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50 WrapperNode [2024-10-11 12:34:50,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:34:50,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:34:50,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:34:50,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:34:50,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:50,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:50,956 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-11 12:34:50,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:34:50,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:34:50,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:34:50,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:34:50,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:50,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:50,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:34:51,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:34:51,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:34:51,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:34:51,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:34:51,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (1/1) ... [2024-10-11 12:34:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:34:51,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:34:51,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:34:51,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:34:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:34:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:34:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:34:51,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:34:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:34:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:34:51,186 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:34:51,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:34:51,454 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:34:51,456 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:34:51,505 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:34:51,506 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:34:51,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:51 BoogieIcfgContainer [2024-10-11 12:34:51,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:34:51,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:34:51,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:34:51,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:34:51,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:34:50" (1/3) ... [2024-10-11 12:34:51,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba35622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:51, skipping insertion in model container [2024-10-11 12:34:51,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:50" (2/3) ... [2024-10-11 12:34:51,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba35622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:51, skipping insertion in model container [2024-10-11 12:34:51,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:51" (3/3) ... [2024-10-11 12:34:51,518 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2024-10-11 12:34:51,535 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:34:51,535 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:34:51,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:34:51,608 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;@63604cc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:34:51,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:34:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:34:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:34:51,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:51,625 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:51,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:51,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2027809662, now seen corresponding path program 1 times [2024-10-11 12:34:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:34:51,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937113615] [2024-10-11 12:34:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:51,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:34:51,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:34:51,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:34:51,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:34:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:51,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 12:34:51,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:34:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:34:52,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:34:52,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:34:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937113615] [2024-10-11 12:34:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937113615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:52,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:34:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354716299] [2024-10-11 12:34:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:52,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:34:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:34:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:34:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:34:52,367 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:52,568 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2024-10-11 12:34:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:34:52,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-11 12:34:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:52,580 INFO L225 Difference]: With dead ends: 131 [2024-10-11 12:34:52,580 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 12:34:52,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:34:52,587 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 40 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:52,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 177 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 12:34:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2024-10-11 12:34:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 12:34:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-10-11 12:34:52,644 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 98 [2024-10-11 12:34:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:52,645 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-10-11 12:34:52,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:34:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-10-11 12:34:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:34:52,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:52,649 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:52,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:34:52,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:34:52,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:52,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1457811008, now seen corresponding path program 1 times [2024-10-11 12:34:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:34:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071971192] [2024-10-11 12:34:52,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:52,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:34:52,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:34:52,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:34:52,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:34:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:52,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:34:53,008 INFO L278 TraceCheckSpWp]: Computing forward predicates...